Solved DSA problems from leetcode
| 0169-majority-element |
| 0015-3sum |
| 0169-majority-element |
| 0274-h-index |
| 0169-majority-element |
| 1502-construct-k-palindrome-strings |
| 3455-minimum-length-of-string-after-operations |
| 0012-integer-to-roman |
| 0013-roman-to-integer |
| 0189-rotate-array |
| 0380-insert-delete-getrandom-o1 |
| 0042-trapping-rain-water |
| 0045-jump-game-ii |
| 0055-jump-game |
| 0121-best-time-to-buy-and-sell-stock |
| 0122-best-time-to-buy-and-sell-stock-ii |
| 0392-is-subsequence |
| 0274-h-index |
| 0380-insert-delete-getrandom-o1 |
| 0380-insert-delete-getrandom-o1 |
| 2059-unique-length-3-palindromic-subsequences |
| 2509-minimize-xor |
| 2533-bitwise-xor-of-all-pairings |
| 2792-neighboring-bitwise-xor |
| 0042-trapping-rain-water |
| 2221-check-if-a-parentheses-string-can-be-valid |
| 0042-trapping-rain-water |
| 0014-longest-common-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 1524-string-matching-in-an-array |
| 2292-counting-words-with-a-given-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 0068-text-justification |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 0167-two-sum-ii-input-array-is-sorted |
| 0209-minimum-size-subarray-sum |
| 0209-minimum-size-subarray-sum |
| 2533-bitwise-xor-of-all-pairings |
| 0407-trapping-rain-water-ii |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
| 1876-map-of-highest-peak |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
| 0407-trapping-rain-water-ii |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
| 0407-trapping-rain-water-ii |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
| 1876-map-of-highest-peak |
| 2145-grid-game |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |