Files

T

tomatocream 7371b2617d Convert roadmap.org problems from list items to subheadings

Problems are now ** TODO headings with proper org tags (:easy:,
:medium:, :hard:) instead of checkbox list items. This enables
org-mode filtering by difficulty, proper subtree folding, and
automatic cookie updates on toggle.

2026-06-01 02:22:17 +08:00

92 KiB

Raw Blame History

NeetCode Roadmap

Arrays & Hashing [/]
Two Pointers [/]
Binary Search [/]
Stack [/]
Sliding Window [/]
Linked List [/]
Trees [/]
Tries [/]
Heap / Priority Queue [/]
Backtracking [/]
Graphs [/]
1-D Dynamic Programming [/]
Intervals [/]
Greedy [/]
Advanced Graphs [/]
Bit Manipulation [/]
Math & Geometry [/]
2-D Dynamic Programming [/]

Source: neetcode.io/roadmap

TODO Arrays & Hashing [/]

TODO 0217. Contains Duplicate easy

TODO 0242. Valid Anagram easy

TODO 0049. Group Anagrams medium

TODO 0347. Top K Frequent Elements medium

TODO 0271. Encode and Decode Strings medium

Python: 0271-encode-and-decode-strings.py
C++: 0271-encode-and-decode-strings.cpp
LeetCode: encode-and-decode-strings/
Video: explanation

TODO 0238. Product of Array Except Self medium

Python: 0238-product-of-array-except-self.py
C++: 0238-product-of-array-except-self.cpp
LeetCode: product-of-array-except-self/
Video: explanation

TODO 1769. Minimum Number of Operations to Move All Balls to Each Box medium

Python: 1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py
C++: 1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp
LeetCode: minimum-number-of-operations-to-move-all-balls-to-each-box/
Video: explanation

TODO 0036. Valid Sudoku medium

TODO 0128. Longest Consecutive Sequence medium

Python: 0128-longest-consecutive-sequence.py
C++: 0128-longest-consecutive-sequence.cpp
LeetCode: longest-consecutive-sequence/
Video: explanation

TODO Two Pointers [/]

TODO 0344. Reverse String easy

TODO 0125. Valid Palindrome easy

TODO 0167. Two Sum II Input Array Is Sorted medium

Python: 0167-two-sum-ii-input-array-is-sorted.py
C++: 0167-two-sum-ii-input-array-is-sorted.cpp
LeetCode: two-sum-ii-input-array-is-sorted/
Video: explanation

TODO 0015. 3Sum medium

Python: 0015-3sum.py
C++: 0015-3sum.cpp
LeetCode: 3sum/
Video: explanation

TODO 0011. Container With Most Water medium

Python: 0011-container-with-most-water.py
C++: 0011-container-with-most-water.cpp
LeetCode: container-with-most-water/
Video: explanation

TODO 0259. 3Sum Smaller medium

TODO 0042. Trapping Rain Water hard

TODO Binary Search [/]

TODO 0704. Binary Search easy

TODO 2300. Successful Pairs of Spells and Potions medium

Python: 2300-successful-pairs-of-spells-and-potions.py
C++: 2300-successful-pairs-of-spells-and-potions.cpp
LeetCode: successful-pairs-of-spells-and-potions/
Video: explanation

TODO 0074. Search a 2D Matrix medium

TODO 0875. Koko Eating Bananas medium

TODO 0153. Find Minimum In Rotated Sorted Array medium

Python: 0153-find-minimum-in-rotated-sorted-array.py
C++: 0153-find-minimum-in-rotated-sorted-array.cpp
LeetCode: find-minimum-in-rotated-sorted-array/
Video: explanation

TODO 0033. Search In Rotated Sorted Array medium

Python: 0033-search-in-rotated-sorted-array.py
C++: 0033-search-in-rotated-sorted-array.cpp
LeetCode: search-in-rotated-sorted-array/
Video: explanation

TODO 0981. Time Based Key Value Store medium

Python: 0981-time-based-key-value-store.py
C++: 0981-time-based-key-value-store.cpp
LeetCode: time-based-key-value-store/
Video: explanation

TODO 0719. Find K-th Smallest Pair Distance hard

Python: 0719-find-k-th-smallest-pair-distance.py
C++: 0719-find-k-th-smallest-pair-distance.cpp
LeetCode: find-k-th-smallest-pair-distance/
Video: explanation

TODO 0004. Median of Two Sorted Arrays hard

Python: 0004-median-of-two-sorted-arrays.py
C++: 0004-median-of-two-sorted-arrays.cpp
LeetCode: median-of-two-sorted-arrays/
Video: explanation

TODO Stack [/]

TODO 0682. Baseball Game easy

TODO 0020. Valid Parentheses easy

TODO 1544. Make The String Great easy

TODO 0155. Min Stack medium

TODO 0150. Evaluate Reverse Polish Notation medium

Python: 0150-evaluate-reverse-polish-notation.py
C++: 0150-evaluate-reverse-polish-notation.cpp
LeetCode: evaluate-reverse-polish-notation/
Video: explanation

TODO 0739. Daily Temperatures medium

TODO 0901. Online Stock Span medium

TODO 0853. Car Fleet medium

TODO 0084. Largest Rectangle In Histogram hard

Python: 0084-largest-rectangle-in-histogram.py
C++: 0084-largest-rectangle-in-histogram.cpp
LeetCode: largest-rectangle-in-histogram/
Video: explanation

TODO 0726. Number of Atoms hard

TODO Sliding Window [/]

TODO 0121. Best Time to Buy And Sell Stock easy

Python: 0121-best-time-to-buy-and-sell-stock.py
C++: 0121-best-time-to-buy-and-sell-stock.cpp
LeetCode: best-time-to-buy-and-sell-stock/
Video: explanation

TODO 0003. Longest Substring Without Repeating Characters medium

Python: 0003-longest-substring-without-repeating-characters.py
C++: 0003-longest-substring-without-repeating-characters.cpp
LeetCode: longest-substring-without-repeating-characters/
Video: explanation

TODO 0424. Longest Repeating Character Replacement medium

Python: 0424-longest-repeating-character-replacement.py
C++: 0424-longest-repeating-character-replacement.cpp
LeetCode: longest-repeating-character-replacement/
Video: explanation

TODO 0567. Permutation In String medium

TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II medium

TODO 0076. Minimum Window Substring hard

Python: 0076-minimum-window-substring.py
C++: 0076-minimum-window-substring.cpp
LeetCode: minimum-window-substring/
Video: explanation

TODO 0239. Sliding Window Maximum hard

TODO Linked List [/]

TODO 0206. Reverse Linked List easy

TODO 0021. Merge Two Sorted Lists easy

TODO 0141. Linked List Cycle easy

TODO 2487. Remove Nodes From Linked List medium

Python: 2487-remove-nodes-from-linked-list.py
C++: 2487-remove-nodes-from-linked-list.cpp
LeetCode: remove-nodes-from-linked-list/
Video: explanation

TODO 0143. Reorder List medium

TODO 0019. Remove Nth Node From End of List medium

Python: 0019-remove-nth-node-from-end-of-list.py
C++: 0019-remove-nth-node-from-end-of-list.cpp
LeetCode: remove-nth-node-from-end-of-list/
Video: explanation

TODO 1721. Swapping Nodes in a Linked List medium

Python: 1721-swapping-nodes-in-a-linked-list.py
C++: 1721-swapping-nodes-in-a-linked-list.cpp
LeetCode: swapping-nodes-in-a-linked-list/
Video: explanation

TODO 0138. Copy List With Random Pointer medium

Python: 0138-copy-list-with-random-pointer.py
C++: 0138-copy-list-with-random-pointer.cpp
LeetCode: copy-list-with-random-pointer/
Video: explanation

TODO 1472. Design Browser History medium

TODO 0002. Add Two Numbers medium

TODO 0287. Find The Duplicate Number medium

Python: 0287-find-the-duplicate-number.py
C++: 0287-find-the-duplicate-number.cpp
LeetCode: find-the-duplicate-number/
Video: explanation

TODO 0725. Split Linked List in Parts medium

Python: 0725-split-linked-list-in-parts.py
C++: 0725-split-linked-list-in-parts.cpp
LeetCode: split-linked-list-in-parts/
Video: explanation

TODO 0146. LRU Cache medium

TODO 0023. Merge K Sorted Lists hard

TODO 0025. Reverse Nodes In K Group hard

Python: 0025-reverse-nodes-in-k-group.py
C++: 0025-reverse-nodes-in-k-group.cpp
LeetCode: reverse-nodes-in-k-group/
Video: explanation

TODO Trees [/]

TODO 0590. N-ary Tree Postorder Traversal easy

Python: 0590-n-ary-tree-postorder-traversal.py
C++: 0590-n-ary-tree-postorder-traversal.cpp
LeetCode: n-ary-tree-postorder-traversal/
Video: explanation

TODO 0226. Invert Binary Tree easy

TODO 0104. Maximum Depth of Binary Tree easy

Python: 0104-maximum-depth-of-binary-tree.py
C++: 0104-maximum-depth-of-binary-tree.cpp
LeetCode: maximum-depth-of-binary-tree/
Video: explanation

TODO 0543. Diameter of Binary Tree easy

TODO 0110. Balanced Binary Tree easy

TODO 0100. Same Tree easy

TODO 0572. Subtree of Another Tree easy

TODO 0235. Lowest Common Ancestor of a Binary Search Tree medium

Python: 0235-lowest-common-ancestor-of-a-binary-search-tree.py
C++: 0235-lowest-common-ancestor-of-a-binary-search-tree.cpp
LeetCode: lowest-common-ancestor-of-a-binary-search-tree/
Video: explanation

TODO 0102. Binary Tree Level Order Traversal medium

Python: 0102-binary-tree-level-order-traversal.py
C++: 0102-binary-tree-level-order-traversal.cpp
LeetCode: binary-tree-level-order-traversal/
Video: explanation

TODO 0199. Binary Tree Right Side View medium

Python: 0199-binary-tree-right-side-view.py
C++: 0199-binary-tree-right-side-view.cpp
LeetCode: binary-tree-right-side-view/
Video: explanation

TODO 1376. Time Needed to Inform All Employees medium

Python: 1376-time-needed-to-inform-all-employees.py
C++: 1376-time-needed-to-inform-all-employees.cpp
LeetCode: time-needed-to-inform-all-employees/
Video: explanation

TODO 1448. Count Good Nodes In Binary Tree medium

Python: 1448-count-good-nodes-in-binary-tree.py
C++: 1448-count-good-nodes-in-binary-tree.cpp
LeetCode: count-good-nodes-in-binary-tree/
Video: explanation

TODO 0098. Validate Binary Search Tree medium

Python: 0098-validate-binary-search-tree.py
C++: 0098-validate-binary-search-tree.cpp
LeetCode: validate-binary-search-tree/
Video: explanation

TODO 0230. Kth Smallest Element In a Bst medium

Python: 0230-kth-smallest-element-in-a-bst.py
C++: 0230-kth-smallest-element-in-a-bst.cpp
LeetCode: kth-smallest-element-in-a-bst/
Video: explanation

TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal medium

Python: 0105-construct-binary-tree-from-preorder-and-inorder-traversal.py
C++: 0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp
LeetCode: construct-binary-tree-from-preorder-and-inorder-traversal/
Video: explanation

TODO 1028. Recover a Tree From Preorder Traversal hard

Python: 1028-recover-a-tree-from-preorder-traversal.py
C++: 1028-recover-a-tree-from-preorder-traversal.cpp
LeetCode: recover-a-tree-from-preorder-traversal/
Video: explanation

TODO 0124. Binary Tree Maximum Path Sum hard

Python: 0124-binary-tree-maximum-path-sum.py
C++: 0124-binary-tree-maximum-path-sum.cpp
LeetCode: binary-tree-maximum-path-sum/
Video: explanation

TODO 0297. Serialize And Deserialize Binary Tree hard

Python: 0297-serialize-and-deserialize-binary-tree.py
C++: 0297-serialize-and-deserialize-binary-tree.cpp
LeetCode: serialize-and-deserialize-binary-tree/
Video: explanation

TODO Tries [/]

TODO 0208. Implement Trie Prefix Tree medium

Python: 0208-implement-trie-prefix-tree.py
C++: 0208-implement-trie-prefix-tree.cpp
LeetCode: implement-trie-prefix-tree/
Video: explanation

TODO 0211. Design Add And Search Words Data Structure medium

Python: 0211-design-add-and-search-words-data-structure.py
C++: 0211-design-add-and-search-words-data-structure.cpp
LeetCode: design-add-and-search-words-data-structure/
Video: explanation

TODO 1166. Design File System medium

TODO 0212. Word Search II hard

TODO Heap / Priority Queue [/]

TODO 0703. Kth Largest Element In a Stream easy

Python: 0703-kth-largest-element-in-a-stream.py
C++: 0703-kth-largest-element-in-a-stream.cpp
LeetCode: kth-largest-element-in-a-stream/
Video: explanation

TODO 1046. Last Stone Weight easy

TODO 0973. K Closest Points to Origin medium

Python: 0973-k-closest-points-to-origin.py
C++: 0973-k-closest-points-to-origin.cpp
LeetCode: k-closest-points-to-origin/
Video: explanation

TODO 0215. Kth Largest Element In An Array medium

Python: 0215-kth-largest-element-in-an-array.py
C++: 0215-kth-largest-element-in-an-array.cpp
LeetCode: kth-largest-element-in-an-array/
Video: explanation

TODO 0621. Task Scheduler medium

TODO 0355. Design Twitter medium

TODO 0295. Find Median From Data Stream hard

Python: 0295-find-median-from-data-stream.py
C++: 0295-find-median-from-data-stream.cpp
LeetCode: find-median-from-data-stream/
Video: explanation

TODO Backtracking [/]

TODO 1863. Sum of All Subsets XOR Total easy

Python: 1863-sum-of-all-subset-xor-totals.py
C++: 1863-sum-of-all-subset-xor-totals.cpp
LeetCode: sum-of-all-subset-xor-totals/
Video: explanation

TODO 0078. Subsets medium

Python: 0078-subsets.py
C++: 0078-subsets.cpp
LeetCode: subsets/
Video: explanation

TODO 0039. Combination Sum medium

TODO 0040. Combination Sum II medium

TODO 0077. Combinations medium

TODO 0046. Permutations medium

TODO 0090. Subsets II medium

TODO 0022. Generate Parentheses medium

TODO 1079. Letter Tile Possibilities medium

Python: 1079-letter-tile-possibilities.py
C++: 1079-letter-tile-possibilities.cpp
LeetCode: letter-tile-possibilities/
Video: explanation

TODO 0079. Word Search medium

TODO 0131. Palindrome Partitioning medium

TODO 0017. Letter Combinations of a Phone Number medium

Python: 0017-letter-combinations-of-a-phone-number.py
C++: 0017-letter-combinations-of-a-phone-number.cpp
LeetCode: letter-combinations-of-a-phone-number/
Video: explanation

TODO 0351. Android Unlock Patterns medium

TODO 0051. N Queens hard

Python: 0051-n-queens.py
C++: 0051-n-queens.cpp
LeetCode: n-queens/
Video: explanation

TODO 0052. N Queens II hard

TODO Graphs [/]

TODO 2924. Find Champion II medium

TODO 0200. Number of Islands medium

TODO 0695. Max Area of Island medium

TODO 2658. Maximum Number of Fish in a Grid medium

Python: 2658-maximum-number-of-fish-in-a-grid.py
C++: 2658-maximum-number-of-fish-in-a-grid.cpp
LeetCode: maximum-number-of-fish-in-a-grid/
Video: explanation

TODO 0133. Clone Graph medium

TODO 0286. Walls And Gates medium

TODO 0994. Rotting Oranges medium

TODO 1905. Count Sub Islands medium

TODO 0417. Pacific Atlantic Water Flow medium

Python: 0417-pacific-atlantic-water-flow.py
C++: 0417-pacific-atlantic-water-flow.cpp
LeetCode: pacific-atlantic-water-flow/
Video: explanation

TODO 0130. Surrounded Regions medium

TODO 0802. Find Eventual Safe States medium

Python: 0802-find-eventual-safe-states.py
C++: 0802-find-eventual-safe-states.cpp
LeetCode: find-eventual-safe-states/
Video: explanation

TODO 0207. Course Schedule medium

TODO 0210. Course Schedule II medium

TODO 0261. Graph Valid Tree medium

TODO 0323. Number of Connected Components In An Undirected Graph medium

Python: 0323-number-of-connected-components-in-an-undirected-graph.py
C++: 0323-number-of-connected-components-in-an-undirected-graph.cpp
LeetCode: number-of-connected-components-in-an-undirected-graph/
Video: explanation

TODO 0684. Redundant Connection medium

TODO 2092. Find All People With Secret hard

Python: 2092-find-all-people-with-secret.py
C++: 2092-find-all-people-with-secret.cpp
LeetCode: find-all-people-with-secret/
Video: explanation

TODO 0127. Word Ladder hard

TODO 1-D Dynamic Programming [/]

TODO 0070. Climbing Stairs easy

TODO 0746. Min Cost Climbing Stairs easy

Python: 0746-min-cost-climbing-stairs.py
C++: 0746-min-cost-climbing-stairs.cpp
LeetCode: min-cost-climbing-stairs/
Video: explanation

TODO 0198. House Robber medium

TODO 0213. House Robber II medium

TODO 0005. Longest Palindromic Substring medium

Python: 0005-longest-palindromic-substring.py
C++: 0005-longest-palindromic-substring.cpp
LeetCode: longest-palindromic-substring/
Video: explanation

TODO 0647. Palindromic Substrings medium

TODO 0091. Decode Ways medium

TODO 0322. Coin Change medium

TODO 0152. Maximum Product Subarray medium

Python: 0152-maximum-product-subarray.py
C++: 0152-maximum-product-subarray.cpp
LeetCode: maximum-product-subarray/
Video: explanation

TODO 0139. Word Break medium

TODO 0300. Longest Increasing Subsequence medium

Python: 0300-longest-increasing-subsequence.py
C++: 0300-longest-increasing-subsequence.cpp
LeetCode: longest-increasing-subsequence/
Video: explanation

TODO 0416. Partition Equal Subset Sum medium

Python: 0416-partition-equal-subset-sum.py
C++: 0416-partition-equal-subset-sum.cpp
LeetCode: partition-equal-subset-sum/
Video: explanation

TODO 0656. Coin Path hard

TODO Intervals [/]

TODO 0057. Insert Interval medium

TODO 0056. Merge Intervals medium

TODO 0435. Non Overlapping Intervals medium

Python: 0435-non-overlapping-intervals.py
C++: 0435-non-overlapping-intervals.cpp
LeetCode: non-overlapping-intervals/
Video: explanation

TODO 0986. Interval List Intersections medium

Python: 0986-interval-list-intersections.py
C++: 0986-interval-list-intersections.cpp
LeetCode: interval-list-intersections/

TODO 0252. Meeting Rooms easy

TODO 0253. Meeting Rooms II medium

TODO 1851. Minimum Interval to Include Each Query hard

Python: 1851-minimum-interval-to-include-each-query.py
C++: 1851-minimum-interval-to-include-each-query.cpp
LeetCode: minimum-interval-to-include-each-query/
Video: explanation

TODO Greedy [/]

TODO 0945. Minimum Increment to Make Array Unique medium

Python: 0945-minimum-increment-to-make-array-unique.py
C++: 0945-minimum-increment-to-make-array-unique.cpp
LeetCode: minimum-increment-to-make-array-unique/
Video: explanation

TODO 0053. Maximum Subarray medium

TODO 0978. Longest Turbulent Subarray medium

Python: 0978-longest-turbulent-subarray.py
C++: 0978-longest-turbulent-subarray.cpp
LeetCode: longest-turbulent-subarray/
Video: explanation

TODO 0055. Jump Game medium

TODO 0045. Jump Game II medium

TODO 1871. Jump Game VII medium

TODO 0134. Gas Station medium

TODO 0846. Hand of Straights medium

TODO 1899. Merge Triplets to Form Target Triplet medium

Python: 1899-merge-triplets-to-form-target-triplet.py
C++: 1899-merge-triplets-to-form-target-triplet.cpp
LeetCode: merge-triplets-to-form-target-triplet/
Video: explanation

TODO 0763. Partition Labels medium

TODO 0678. Valid Parenthesis String medium

Python: 0678-valid-parenthesis-string.py
C++: 0678-valid-parenthesis-string.cpp
LeetCode: valid-parenthesis-string/
Video: explanation

TODO Advanced Graphs [/]

TODO 0743. Network Delay Time medium

TODO 0332. Reconstruct Itinerary hard

TODO 1584. Min Cost to Connect All Points medium

Python: 1584-min-cost-to-connect-all-points.py
C++: 1584-min-cost-to-connect-all-points.cpp
LeetCode: min-cost-to-connect-all-points/
Video: explanation

TODO 2812. Find the Safest Path in a Grid medium

Python: 2812-find-the-safest-path-in-a-grid.py
C++: 2812-find-the-safest-path-in-a-grid.cpp
LeetCode: find-the-safest-path-in-a-grid/
Video: explanation

TODO 0778. Swim In Rising Water hard

TODO 0269. Alien Dictionary hard

TODO 0787. Cheapest Flights Within K Stops medium

Python: 0787-cheapest-flights-within-k-stops.py
C++: 0787-cheapest-flights-within-k-stops.cpp
LeetCode: cheapest-flights-within-k-stops/
Video: explanation

TODO 2493. Divide Nodes Into the Maximum Number of Groups hard

Python: 2493-divide-nodes-into-the-maximum-number-of-groups.py
C++: 2493-divide-nodes-into-the-maximum-number-of-groups.cpp
LeetCode: divide-nodes-into-the-maximum-number-of-groups/
Video: explanation

TODO Bit Manipulation [/]

TODO 0136. Single Number easy

TODO 0260. Single Number III medium

TODO 0191. Number of 1 Bits easy

TODO 0338. Counting Bits easy

TODO 2220. Minimum Bit Flips to Convert Number easy

Python: 2220-minimum-bit-flips-to-convert-number.py
C++: 2220-minimum-bit-flips-to-convert-number.cpp
LeetCode: minimum-bit-flips-to-convert-number/
Video: explanation

TODO 0190. Reverse Bits easy

TODO 0268. Missing Number easy

TODO 0231. Power of Two easy

TODO 0371. Sum of Two Integers medium

TODO 0007. Reverse Integer medium

TODO Math & Geometry [/]

TODO 0840. Magic Squares In Grid medium

TODO 0048. Rotate Image medium

TODO 0054. Spiral Matrix medium

TODO 2326. Spiral Matrix IV medium

TODO 0073. Set Matrix Zeroes medium

TODO 0202. Happy Number easy

TODO 0066. Plus One easy

Python: 0066-plus-one.py
C++: 0066-plus-one.cpp
LeetCode: plus-one/
Video: explanation

TODO 0009. Palindrome Number easy

TODO 0012. Integer to Roman medium

TODO 0050. Pow(x, n) medium

Python: 0050-powx-n.py
C++: 0050-powx-n.cpp
LeetCode: powx-n/
Video: explanation

TODO 2698. Find the Punishment Number of an Integer medium

Python: 2698-find-the-punishment-number-of-an-integer.py
C++: 2698-find-the-punishment-number-of-an-integer.cpp
LeetCode: find-the-punishment-number-of-an-integer/
Video: explanation

TODO 1780. Check if Number is a Sum of Powers of Three medium

Python: 1780-check-if-number-is-a-sum-of-powers-of-three.py
C++: 1780-check-if-number-is-a-sum-of-powers-of-three.cpp
LeetCode: check-if-number-is-a-sum-of-powers-of-three/
Video: explanation

TODO 0043. Multiply Strings medium

TODO 2013. Detect Squares medium

TODO 0296. Best Meeting Point hard

TODO 2-D Dynamic Programming [/]

TODO 0062. Unique Paths medium

TODO 1143. Longest Common Subsequence medium

Python: 1143-longest-common-subsequence.py
C++: 1143-longest-common-subsequence.cpp
LeetCode: longest-common-subsequence/
Video: explanation

TODO 0309. Best Time to Buy And Sell Stock With Cooldown medium

Python: 0309-best-time-to-buy-and-sell-stock-with-cooldown.py
C++: 0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp
LeetCode: best-time-to-buy-and-sell-stock-with-cooldown/
Video: explanation

TODO 0518. Coin Change II medium

TODO 0494. Target Sum medium

TODO 0097. Interleaving String medium

TODO 0329. Longest Increasing Path In a Matrix hard

Python: 0329-longest-increasing-path-in-a-matrix.py
C++: 0329-longest-increasing-path-in-a-matrix.cpp
LeetCode: longest-increasing-path-in-a-matrix/
Video: explanation

TODO 1911. Maximum Alternating Subsequence Sum medium

Python: 1911-maximum-alternating-subsequence-sum.py
C++: 1911-maximum-alternating-subsequence-sum.cpp
LeetCode: maximum-alternating-subsequence-sum/
Video: explanation

TODO 0115. Distinct Subsequences hard

TODO 0072. Edit Distance medium

TODO 1220. Count Vowels Permutation hard

Python: 1220-count-vowels-permutation.py
C++: 1220-count-vowels-permutation.cpp
LeetCode: count-vowels-permutation/
Video: explanation

TODO 0312. Burst Balloons hard

TODO 0010. Regular Expression Matching hard

Python: 0010-regular-expression-matching.py
C++: 0010-regular-expression-matching.cpp
LeetCode: regular-expression-matching/
Video: explanation

92 KiB Raw Blame History

NeetCode Roadmap

TODO Arrays & Hashing [/]

TODO 0217. Contains Duplicate easy

TODO 0242. Valid Anagram easy

TODO 2678. Number of Senior Citizens easy

TODO 0001. Two Sum easy

TODO 1408. String Matching in an Array easy

TODO 0049. Group Anagrams medium

TODO 0347. Top K Frequent Elements medium

TODO 0271. Encode and Decode Strings medium

TODO 0238. Product of Array Except Self medium

TODO 1769. Minimum Number of Operations to Move All Balls to Each Box medium

TODO 0036. Valid Sudoku medium

TODO 0128. Longest Consecutive Sequence medium

TODO Two Pointers [/]

TODO 0344. Reverse String easy

TODO 0125. Valid Palindrome easy

TODO 0167. Two Sum II Input Array Is Sorted medium

TODO 0015. 3Sum medium

TODO 0011. Container With Most Water medium

TODO 0259. 3Sum Smaller medium

TODO 0042. Trapping Rain Water hard

TODO Binary Search [/]

TODO 0704. Binary Search easy

TODO 2300. Successful Pairs of Spells and Potions medium

TODO 0074. Search a 2D Matrix medium

TODO 0875. Koko Eating Bananas medium

TODO 0153. Find Minimum In Rotated Sorted Array medium

TODO 0033. Search In Rotated Sorted Array medium

TODO 0981. Time Based Key Value Store medium

TODO 0719. Find K-th Smallest Pair Distance hard

TODO 0004. Median of Two Sorted Arrays hard

TODO Stack [/]

TODO 0682. Baseball Game easy

TODO 0020. Valid Parentheses easy

TODO 1544. Make The String Great easy

TODO 0155. Min Stack medium

TODO 0150. Evaluate Reverse Polish Notation medium

TODO 0739. Daily Temperatures medium

TODO 0901. Online Stock Span medium

TODO 0853. Car Fleet medium

TODO 0084. Largest Rectangle In Histogram hard

TODO 0726. Number of Atoms hard

TODO Sliding Window [/]

TODO 0121. Best Time to Buy And Sell Stock easy

TODO 0003. Longest Substring Without Repeating Characters medium

TODO 0424. Longest Repeating Character Replacement medium

TODO 0567. Permutation In String medium

TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II medium

TODO 0076. Minimum Window Substring hard

TODO 0239. Sliding Window Maximum hard

TODO Linked List [/]

TODO 0206. Reverse Linked List easy

TODO 0021. Merge Two Sorted Lists easy

TODO 0141. Linked List Cycle easy

TODO 2487. Remove Nodes From Linked List medium

TODO 0143. Reorder List medium

TODO 0019. Remove Nth Node From End of List medium

TODO 1721. Swapping Nodes in a Linked List medium

TODO 0138. Copy List With Random Pointer medium

TODO 1472. Design Browser History medium

TODO 0002. Add Two Numbers medium

TODO 0287. Find The Duplicate Number medium

TODO 0725. Split Linked List in Parts medium

TODO 0146. LRU Cache medium

TODO 0023. Merge K Sorted Lists hard

TODO 0025. Reverse Nodes In K Group hard

TODO Trees [/]

TODO 0590. N-ary Tree Postorder Traversal easy

TODO 0226. Invert Binary Tree easy

TODO 0104. Maximum Depth of Binary Tree easy

TODO 0543. Diameter of Binary Tree easy

TODO 0110. Balanced Binary Tree easy

TODO 0100. Same Tree easy

TODO 0572. Subtree of Another Tree easy

TODO 0235. Lowest Common Ancestor of a Binary Search Tree medium

TODO 0102. Binary Tree Level Order Traversal medium

TODO 0199. Binary Tree Right Side View medium

TODO 1376. Time Needed to Inform All Employees medium

92 KiB

Raw Blame History