This repo contains all the problems I pricticed from the leetcode for the interview preparations conatins most of problems from the https://neetcode.io/roadmap, https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/ and Blind-75.
This repo has been updated using chrome extension LeetHub-2.0 and LeetHub to auto commit the problems once I solved them on leetcode.
0155-min-stack |
0208-implement-trie-prefix-tree |
0380-insert-delete-getrandom-o1 |
2429-design-a-food-rating-system |
2434-design-a-number-container-system |
3678-design-task-manager |
0042-trapping-rain-water |
0739-daily-temperatures |
0780-max-chunks-to-make-sorted |
1570-final-prices-with-a-special-discount-in-a-shop |
3181-find-building-where-alice-and-bob-can-meet |
0011-container-with-most-water |
0678-valid-parenthesis-string |
0780-max-chunks-to-make-sorted |
1502-construct-k-palindrome-strings |
2221-check-if-a-parentheses-string-can-be-valid |
2509-minimize-xor |
0028-find-the-index-of-the-first-occurrence-in-a-string |
0459-repeated-substring-pattern |
1524-string-matching-in-an-array |
2292-counting-words-with-a-given-prefix |
3309-count-prefix-and-suffix-pairs-i |
0167-two-sum-ii-input-array-is-sorted |
0268-missing-number |
2392-successful-pairs-of-spells-and-potions |
2586-longest-square-streak-in-an-array |
3181-find-building-where-alice-and-bob-can-meet |
3181-find-building-where-alice-and-bob-can-meet |
3181-find-building-where-alice-and-bob-can-meet |
0022-generate-parentheses |
0494-target-sum |
0070-climbing-stairs |
0139-word-break |
2429-design-a-food-rating-system |
2434-design-a-number-container-system |
3678-design-task-manager |
0062-unique-paths |
0002-add-two-numbers |
0002-add-two-numbers |
0139-word-break |
0208-implement-trie-prefix-tree |
3309-count-prefix-and-suffix-pairs-i |
3309-count-prefix-and-suffix-pairs-i |
3309-count-prefix-and-suffix-pairs-i |
1642-water-bottles |
2791-find-the-losers-of-the-circular-game |
3434-find-the-number-of-distinct-colors-among-the-balls |
2533-bitwise-xor-of-all-pairings |
0190-reverse-bits |
0191-number-of-1-bits |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
0207-course-schedule |
0210-course-schedule-ii |
0820-find-eventual-safe-states |
1558-course-schedule-iv |
2246-maximum-employees-to-be-invited-to-a-meeting |
1217-relative-sort-array |
0653-two-sum-iv-input-is-a-bst |
0380-insert-delete-getrandom-o1 |