DSA questions solved
| 0169-majority-element |
| 0229-majority-element-ii |
| 0387-first-unique-character-in-a-string |
| 1635-number-of-good-pairs |
| 2116-count-number-of-pairs-with-absolute-difference-k |
| 0023-merge-k-sorted-lists |
| 0148-sort-list |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0803-cheapest-flights-within-k-stops |
| 1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance |
| 2121-find-if-path-exists-in-graph |
| 0803-cheapest-flights-within-k-stops |
| 1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance |
| 0036-valid-sudoku |
| 1463-the-k-weakest-rows-in-a-matrix |
| 1677-matrix-diagonal-sum |
| 1013-fibonacci-number |
| 1236-n-th-tribonacci-number |
| 0039-combination-sum |
| 0040-combination-sum-ii |
| 0046-permutations |
| 0052-n-queens-ii |
| 1993-sum-of-all-subset-xor-totals |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0572-subtree-of-another-tree |
| 0003-longest-substring-without-repeating-characters |
| 0239-sliding-window-maximum |
| 1993-sum-of-all-subset-xor-totals |
| 1993-sum-of-all-subset-xor-totals |
| 0084-largest-rectangle-in-histogram |
| 0496-next-greater-element-i |
| 0937-online-stock-span |
| 0937-online-stock-span |
| 0969-number-of-recent-calls |
| 1767-design-front-middle-back-queue |
| 0014-longest-common-prefix |
| 0208-implement-trie-prefix-tree |
| 0572-subtree-of-another-tree |
| 0816-design-hashset |
| 0817-design-hashmap |
| 0098-validate-binary-search-tree |
| 0108-convert-sorted-array-to-binary-search-tree |
| 0450-delete-node-in-a-bst |
| 0975-range-sum-of-bst |
| 1285-balance-a-binary-search-tree |
| 1475-maximum-sum-bst-in-binary-tree |
| 1014-k-closest-points-to-origin |
| 0215-kth-largest-element-in-an-array |
| 1014-k-closest-points-to-origin |
| 0239-sliding-window-maximum |
| 2121-find-if-path-exists-in-graph |