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 |
| 3678-design-task-manager |
| 0002-add-two-numbers |
| 0062-unique-paths |
| 0066-plus-one |
| 0070-climbing-stairs |
| 0150-evaluate-reverse-polish-notation |
| 2812-find-the-maximum-achievable-number |
| 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 |
| 0780-max-chunks-to-make-sorted |
| 1502-construct-k-palindrome-strings |
| 0015-3sum |
| 0018-4sum |
| 0088-merge-sorted-array |
| 0242-valid-anagram |
| 0389-find-the-difference |
| 0780-max-chunks-to-make-sorted |
| 0337-house-robber-iii |
| 0515-find-largest-value-in-each-tree-row |
| 2493-reverse-odd-levels-of-binary-tree |
| 3058-maximum-number-of-k-divisible-components |
| 3439-find-minimum-diameter-after-merging-two-trees |
| 0515-find-largest-value-in-each-tree-row |
| 2493-reverse-odd-levels-of-binary-tree |
| 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level |
| 3439-find-minimum-diameter-after-merging-two-trees |
| 0337-house-robber-iii |
| 0515-find-largest-value-in-each-tree-row |
| 2493-reverse-odd-levels-of-binary-tree |
| 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level |
| 0338-counting-bits |
| 0389-find-the-difference |
| 2059-unique-length-3-palindromic-subsequences |
| 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 |
| 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 |
| 3181-find-building-where-alice-and-bob-can-meet |
| 3678-design-task-manager |
| 3439-find-minimum-diameter-after-merging-two-trees |
| 0494-target-sum |
| 0070-climbing-stairs |
| 0139-word-break |
| 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 |
| 2791-find-the-losers-of-the-circular-game |
| 0063-unique-paths-ii |
| 1502-construct-k-palindrome-strings |