This repository contains solutions to various data structures and algorithms practice questions from LeetCode and GeeksforGeeks. Each problem is solved in C++, and the solutions are organized for each questions separately.
| 0014-longest-common-prefix |
| 0648-replace-words |
| 0061-rotate-list |
| 0083-remove-duplicates-from-sorted-list |
| 0148-sort-list |
| 0012-integer-to-roman |
| 0067-add-binary |
| 0171-excel-sheet-column-number |
| 0523-continuous-subarray-sum |
| 0633-sum-of-square-numbers |
| 1370-count-number-of-nice-subarrays |
| 0523-continuous-subarray-sum |
| 1016-subarray-sums-divisible-by-k |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 0561-array-partition |
| 0948-sort-an-array |
| 0982-minimum-increment-to-make-array-unique |
| 1137-height-checker |
| 1217-relative-sort-array |
| 0108-convert-sorted-array-to-binary-search-tree |
| 0148-sort-list |
| 0948-sort-an-array |
| 1285-balance-a-binary-search-tree |
| 0502-ipo |
| 0948-sort-an-array |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 0148-sort-list |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0020-valid-parentheses |
| 0094-binary-tree-inorder-traversal |
| 0067-add-binary |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 0067-add-binary |
| 0100-same-tree |
| 0104-maximum-depth-of-binary-tree |
| 0111-minimum-depth-of-binary-tree |
| 0112-path-sum |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1138-grumpy-bookstore-owner |
| 1370-count-number-of-nice-subarrays |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 0108-convert-sorted-array-to-binary-search-tree |
| 0538-convert-bst-to-greater-tree |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1916-find-center-of-star-graph |
| 0278-first-bad-version |
| 0190-reverse-bits |
| 0948-sort-an-array |
| 1382-balance-a-binary-search-tree |
| 2280-count-good-triplets-in-an-array |
| 3719-longest-balanced-subarray-i |
| 3721-longest-balanced-subarray-ii |
| 0948-sort-an-array |
| 2280-count-good-triplets-in-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 1511-count-number-of-teams |
| 2280-count-good-triplets-in-an-array |
| 3181-find-building-where-alice-and-bob-can-meet |
| 1691-minimum-number-of-days-to-disconnect-island |
| 1240-stone-game-ii |
| 3462-vowels-game-in-a-string |
| 2503-longest-subarray-with-maximum-bitwise-and |
| 2533-bitwise-xor-of-all-pairings |
| 3462-vowels-game-in-a-string |
| 3577-count-the-number-of-computer-unlocking-permutations |
| 0214-shortest-palindrome |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0214-shortest-palindrome |
| 0812-rotate-string |
| 1524-string-matching-in-an-array |
| 2292-counting-words-with-a-given-prefix |
| 0214-shortest-palindrome |
| 2079-delete-duplicate-folders-in-system |
| 0432-all-oone-data-structure |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 2201-valid-arrangement-of-pairs |
| 0239-sliding-window-maximum |
| 2180-maximum-number-of-tasks-you-can-assign |
| 2527-count-subarrays-with-fixed-bounds |
| 2868-continuous-subarrays |
| 3578-count-partitions-with-max-min-difference-at-most-k |
| 1477-product-of-the-last-k-numbers |
| 0826-soup-servings |
| 0867-new-21-game |
| 3233-maximize-the-number-of-partitions-after-operations |
| 3851-find-sum-of-array-product-of-magical-sequences |
| 0181-employees-earning-more-than-their-managers |
| 0584-find-customer-referee |
| 0620-not-boring-movies |
| 3454-separate-squares-ii |
| 2976-minimum-cost-to-convert-string-i |
| 2977-minimum-cost-to-convert-string-ii |
| 3650-minimum-cost-path-with-edge-reversals |