My personal collection of LeetCode problem solutions, documented for learning and interview preparation. 💻 Data Structures & Algorithms | FAANG Interview Preparation | Optimized Solutions.
My personal collection of LeetCode problem solutions.
- Total Problems Solved:
- Easy:
- Medium:
- Hard:
Note: Solutions are written in C++ and Java.(Harshit seth)
| 0110-balanced-binary-tree |
| 1022-sum-of-root-to-leaf-binary-numbers |
| 1382-balance-a-binary-search-tree |
| 0110-balanced-binary-tree |
| 1022-sum-of-root-to-leaf-binary-numbers |
| 1382-balance-a-binary-search-tree |
| 0110-balanced-binary-tree |
| 1022-sum-of-root-to-leaf-binary-numbers |
| 1382-balance-a-binary-search-tree |
| 0046-permutations |
| 0401-binary-watch |
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n |
| 1980-find-unique-binary-string |
| 0190-reverse-bits |
| 0761-special-binary-string |
| 1382-balance-a-binary-search-tree |
| 3719-longest-balanced-subarray-i |
| 3721-longest-balanced-subarray-ii |
| 1622-fancy-sequence |
| 3719-longest-balanced-subarray-i |
| 3721-longest-balanced-subarray-ii |
| 1356-sort-integers-by-the-number-of-1-bits |
| 3713-longest-balanced-substring-i |
| 3713-longest-balanced-substring-i |
| 0067-add-binary |
| 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one |
| 1545-find-kth-bit-in-nth-binary-string |
| 1680-concatenation-of-consecutive-binary-numbers |
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 0278-first-bad-version |
| 3666-minimum-operations-to-equalize-binary-string |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 3666-minimum-operations-to-equalize-binary-string |
| 3666-minimum-operations-to-equalize-binary-string |
| 0021-merge-two-sorted-lists |
| 0206-reverse-linked-list |
| 0231-power-of-two |
| 0234-palindrome-linked-list |
| 0509-fibonacci-number |
| 1545-find-kth-bit-in-nth-binary-string |
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 1878-get-biggest-three-rhombus-sums-in-a-grid |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero |
| 1622-fancy-sequence |
| 0070-climbing-stairs |
| 0509-fibonacci-number |
| 0019-remove-nth-node-from-end-of-list |
| 0021-merge-two-sorted-lists |
| 0083-remove-duplicates-from-sorted-list |
| 0206-reverse-linked-list |
| 0234-palindrome-linked-list |
| 0234-palindrome-linked-list |