In this repository I add my solved regular basis coding question of DSA
0238-product-of-array-except-self |
1016-subarray-sums-divisible-by-k |
0105-construct-binary-tree-from-preorder-and-inorder-traversal |
0169-majority-element |
0191-number-of-1-bits |
0347-top-k-frequent-elements |
0239-sliding-window-maximum |
0347-top-k-frequent-elements |
0502-ipo |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
3363-most-frequent-ids |
0347-top-k-frequent-elements |
0347-top-k-frequent-elements |
0347-top-k-frequent-elements |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
3363-most-frequent-ids |
0239-sliding-window-maximum |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
0003-longest-substring-without-repeating-characters |
0239-sliding-window-maximum |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
0239-sliding-window-maximum |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
0105-construct-binary-tree-from-preorder-and-inorder-traversal |
0105-construct-binary-tree-from-preorder-and-inorder-traversal |
0137-single-number-ii |
0191-number-of-1-bits |
0461-hamming-distance |
0476-number-complement |
0477-total-hamming-distance |
0899-binary-gap |
2519-find-the-original-array-of-prefix-xor |
2048-build-array-from-permutation |
2058-concatenation-of-array |
2137-final-value-of-variable-after-performing-operations |
2800-minimum-string-length-after-removing-substrings |
0167-two-sum-ii-input-array-is-sorted |
2917-count-pairs-whose-sum-is-less-than-target |
0121-best-time-to-buy-and-sell-stock |
0122-best-time-to-buy-and-sell-stock-ii |
0392-is-subsequence |
1916-find-center-of-star-graph |
1720-crawler-log-folder |
1737-maximum-nesting-depth-of-the-parentheses |
2800-minimum-string-length-after-removing-substrings |
0045-jump-game-ii |
0055-jump-game |
0455-assign-cookies |
0680-valid-palindrome-ii |
1228-minimum-cost-tree-from-leaf-values |
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves |
0948-sort-an-array |
0954-maximum-sum-circular-subarray |
0954-maximum-sum-circular-subarray |
1951-find-the-winner-of-the-circular-game |
0954-maximum-sum-circular-subarray |
0028-find-the-index-of-the-first-occurrence-in-a-string |
0459-repeated-substring-pattern |
0292-nim-game |
0292-nim-game |
0495-teemo-attacking |
1642-water-bottles |
1803-average-waiting-time |
1951-find-the-winner-of-the-circular-game |
2299-merge-nodes-in-between-zeros |
2645-pass-the-pillow |
2846-robot-collisions |
0131-palindrome-partitioning |
0021-merge-two-sorted-lists |
0206-reverse-linked-list |
1951-find-the-winner-of-the-circular-game |
1496-lucky-numbers-in-a-matrix |
0208-implement-trie-prefix-tree |
0014-longest-common-prefix |
0208-implement-trie-prefix-tree |
0287-find-the-duplicate-number |
0658-find-k-closest-elements |
0948-sort-an-array |
0948-sort-an-array |
0948-sort-an-array |
0948-sort-an-array |
0948-sort-an-array |
0658-find-k-closest-elements |
0943-sum-of-subarray-minimums |
1228-minimum-cost-tree-from-leaf-values |
0620-not-boring-movies |
1161-project-employees-i |
1811-fix-names-in-a-table |
0133-clone-graph |
0207-course-schedule |
0210-course-schedule-ii |
0207-course-schedule |
0210-course-schedule-ii |
0523-continuous-subarray-sum |