2026-06-01 02:07:20 +08:00
|
|
|
#+TITLE: NeetCode Roadmap
|
|
|
|
|
#+DATE: 2026-05-31
|
|
|
|
|
#+TODO: TODO DONE
|
|
|
|
|
#+STARTUP: overview
|
|
|
|
|
|
|
|
|
|
Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
* TODO Arrays & Hashing [/]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0217. Contains Duplicate :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0217-contains-duplicate.py][0217-contains-duplicate.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0217-contains-duplicate.cpp][0217-contains-duplicate.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/contains-duplicate/][contains-duplicate/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=3OamzN90kPg][explanation]]
|
|
|
|
|
** TODO 0242. Valid Anagram :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0242-valid-anagram.py][0242-valid-anagram.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][0242-valid-anagram.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/valid-anagram/][valid-anagram/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=9UtInBqnCgA][explanation]]
|
|
|
|
|
** TODO 2678. Number of Senior Citizens :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2678-number-of-senior-citizens.py][2678-number-of-senior-citizens.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2678-number-of-senior-citizens.cpp][2678-number-of-senior-citizens.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/number-of-senior-citizens/][number-of-senior-citizens/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=l6_wwKzFmVo][explanation]]
|
|
|
|
|
** TODO 0001. Two Sum :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0001-two-sum.py][0001-two-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0001-two-sum.cpp][0001-two-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/two-sum/][two-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=KLlXCFG5TnA][explanation]]
|
|
|
|
|
** TODO 1408. String Matching in an Array :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1408-string-matching-in-an-array.py][1408-string-matching-in-an-array.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1408-string-matching-in-an-array.cpp][1408-string-matching-in-an-array.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/string-matching-in-an-array/][string-matching-in-an-array/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=7K2BjgjCFDo][explanation]]
|
|
|
|
|
** TODO 0049. Group Anagrams :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0049-group-anagrams.py][0049-group-anagrams.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0049-group-anagrams.cpp][0049-group-anagrams.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/group-anagrams/][group-anagrams/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=vzdNOK2oB2E][explanation]]
|
|
|
|
|
** TODO 0347. Top K Frequent Elements :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0347-top-k-frequent-elements.py][0347-top-k-frequent-elements.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0347-top-k-frequent-elements.cpp][0347-top-k-frequent-elements.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/top-k-frequent-elements/][top-k-frequent-elements/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=YPTqKIgVk-k][explanation]]
|
|
|
|
|
** TODO 0271. Encode and Decode Strings :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0271-encode-and-decode-strings.py][0271-encode-and-decode-strings.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0271-encode-and-decode-strings.cpp][0271-encode-and-decode-strings.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/encode-and-decode-strings/][encode-and-decode-strings/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=B1k_sxOSgv8][explanation]]
|
|
|
|
|
** TODO 0238. Product of Array Except Self :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0238-product-of-array-except-self.py][0238-product-of-array-except-self.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0238-product-of-array-except-self.cpp][0238-product-of-array-except-self.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/product-of-array-except-self/][product-of-array-except-self/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=bNvIQI2wAjk][explanation]]
|
|
|
|
|
** TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/][minimum-number-of-operations-to-move-all-balls-to-each-box/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ZmH3gHiIqfI][explanation]]
|
|
|
|
|
** TODO 0036. Valid Sudoku :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0036-valid-sudoku.py][0036-valid-sudoku.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0036-valid-sudoku.cpp][0036-valid-sudoku.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/valid-sudoku/][valid-sudoku/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=TjFXEUCMqI8][explanation]]
|
|
|
|
|
** TODO 0128. Longest Consecutive Sequence :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0128-longest-consecutive-sequence.py][0128-longest-consecutive-sequence.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0128-longest-consecutive-sequence.cpp][0128-longest-consecutive-sequence.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-consecutive-sequence/][longest-consecutive-sequence/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=P6RZZMu_maU][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Two Pointers [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0344. Reverse String :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0344-reverse-string.py][0344-reverse-string.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0344-reverse-string.cpp][0344-reverse-string.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reverse-string/][reverse-string/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=_d0T_2Lk2qA][explanation]]
|
|
|
|
|
** TODO 0125. Valid Palindrome :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0125-valid-palindrome.py][0125-valid-palindrome.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0125-valid-palindrome.cpp][0125-valid-palindrome.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/valid-palindrome/][valid-palindrome/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=jJXJ16kPFWg][explanation]]
|
|
|
|
|
** TODO 0167. Two Sum II Input Array Is Sorted :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0167-two-sum-ii-input-array-is-sorted.py][0167-two-sum-ii-input-array-is-sorted.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0167-two-sum-ii-input-array-is-sorted.cpp][0167-two-sum-ii-input-array-is-sorted.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/][two-sum-ii-input-array-is-sorted/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=cQ1Oz4ckceM][explanation]]
|
|
|
|
|
** TODO 0015. 3Sum :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0015-3sum.py][0015-3sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0015-3sum.cpp][0015-3sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/3sum/][3sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=jzZsG8n2R9A][explanation]]
|
|
|
|
|
** TODO 0011. Container With Most Water :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0011-container-with-most-water.py][0011-container-with-most-water.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0011-container-with-most-water.cpp][0011-container-with-most-water.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/container-with-most-water/][container-with-most-water/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=UuiTKBwPgAo][explanation]]
|
|
|
|
|
** TODO 0259. 3Sum Smaller :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0259-3sum-smaller.py][0259-3sum-smaller.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0259-3sum-smaller.cpp][0259-3sum-smaller.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/3sum-smaller/][3sum-smaller/]]
|
|
|
|
|
** TODO 0042. Trapping Rain Water :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0042-trapping-rain-water.py][0042-trapping-rain-water.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0042-trapping-rain-water.cpp][0042-trapping-rain-water.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/trapping-rain-water/][trapping-rain-water/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ZI2z5pq0TqA][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Binary Search [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0704. Binary Search :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0704-binary-search.py][0704-binary-search.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0704-binary-search.cpp][0704-binary-search.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/binary-search/][binary-search/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=s4DPM8ct1pI][explanation]]
|
|
|
|
|
** TODO 2300. Successful Pairs of Spells and Potions :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2300-successful-pairs-of-spells-and-potions.py][2300-successful-pairs-of-spells-and-potions.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2300-successful-pairs-of-spells-and-potions.cpp][2300-successful-pairs-of-spells-and-potions.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/successful-pairs-of-spells-and-potions/][successful-pairs-of-spells-and-potions/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=OKnm5oyAhWg][explanation]]
|
|
|
|
|
** TODO 0074. Search a 2D Matrix :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0074-search-a-2d-matrix.py][0074-search-a-2d-matrix.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0074-search-a-2d-matrix.cpp][0074-search-a-2d-matrix.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/search-a-2d-matrix/][search-a-2d-matrix/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Ber2pi2C0j0][explanation]]
|
|
|
|
|
** TODO 0875. Koko Eating Bananas :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0875-koko-eating-bananas.py][0875-koko-eating-bananas.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0875-koko-eating-bananas.cpp][0875-koko-eating-bananas.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/koko-eating-bananas/][koko-eating-bananas/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=U2SozAs9RzA][explanation]]
|
|
|
|
|
** TODO 0153. Find Minimum In Rotated Sorted Array :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0153-find-minimum-in-rotated-sorted-array.py][0153-find-minimum-in-rotated-sorted-array.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0153-find-minimum-in-rotated-sorted-array.cpp][0153-find-minimum-in-rotated-sorted-array.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/][find-minimum-in-rotated-sorted-array/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=nIVW4P8b1VA][explanation]]
|
|
|
|
|
** TODO 0033. Search In Rotated Sorted Array :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0033-search-in-rotated-sorted-array.py][0033-search-in-rotated-sorted-array.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0033-search-in-rotated-sorted-array.cpp][0033-search-in-rotated-sorted-array.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/search-in-rotated-sorted-array/][search-in-rotated-sorted-array/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=U8XENwh8Oy8][explanation]]
|
|
|
|
|
** TODO 0981. Time Based Key Value Store :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0981-time-based-key-value-store.py][0981-time-based-key-value-store.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0981-time-based-key-value-store.cpp][0981-time-based-key-value-store.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/time-based-key-value-store/][time-based-key-value-store/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=fu2cD_6E8Hw][explanation]]
|
|
|
|
|
** TODO 0719. Find K-th Smallest Pair Distance :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0719-find-k-th-smallest-pair-distance.py][0719-find-k-th-smallest-pair-distance.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0719-find-k-th-smallest-pair-distance.cpp][0719-find-k-th-smallest-pair-distance.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-k-th-smallest-pair-distance/][find-k-th-smallest-pair-distance/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=bQ-QcFKwsZc][explanation]]
|
|
|
|
|
** TODO 0004. Median of Two Sorted Arrays :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0004-median-of-two-sorted-arrays.py][0004-median-of-two-sorted-arrays.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0004-median-of-two-sorted-arrays.cpp][0004-median-of-two-sorted-arrays.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/median-of-two-sorted-arrays/][median-of-two-sorted-arrays/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=q6IEA26hvXc][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Stack [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0682. Baseball Game :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0682-baseball-game.py][0682-baseball-game.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0682-baseball-game.cpp][0682-baseball-game.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/baseball-game/][baseball-game/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Id_tqGdsZQI][explanation]]
|
|
|
|
|
** TODO 0020. Valid Parentheses :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0020-valid-parentheses.py][0020-valid-parentheses.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0020-valid-parentheses.cpp][0020-valid-parentheses.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/valid-parentheses/][valid-parentheses/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=WTzjTskDFMg][explanation]]
|
|
|
|
|
** TODO 1544. Make The String Great :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1544-make-the-string-great.py][1544-make-the-string-great.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1544-make-the-string-great.cpp][1544-make-the-string-great.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/make-the-string-great/][make-the-string-great/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=10tBWNjzvtw][explanation]]
|
|
|
|
|
** TODO 0155. Min Stack :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0155-min-stack.py][0155-min-stack.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0155-min-stack.cpp][0155-min-stack.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/min-stack/][min-stack/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=qkLl7nAwDPo][explanation]]
|
|
|
|
|
** TODO 0150. Evaluate Reverse Polish Notation :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0150-evaluate-reverse-polish-notation.py][0150-evaluate-reverse-polish-notation.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0150-evaluate-reverse-polish-notation.cpp][0150-evaluate-reverse-polish-notation.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/evaluate-reverse-polish-notation/][evaluate-reverse-polish-notation/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=iu0082c4HDE][explanation]]
|
|
|
|
|
** TODO 0739. Daily Temperatures :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0739-daily-temperatures.py][0739-daily-temperatures.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0739-daily-temperatures.cpp][0739-daily-temperatures.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/daily-temperatures/][daily-temperatures/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=cTBiBSnjO3c][explanation]]
|
|
|
|
|
** TODO 0901. Online Stock Span :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0901-online-stock-span.py][0901-online-stock-span.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0901-online-stock-span.cpp][0901-online-stock-span.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/online-stock-span/][online-stock-span/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=slYh0ZNEqSw][explanation]]
|
|
|
|
|
** TODO 0853. Car Fleet :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0853-car-fleet.py][0853-car-fleet.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0853-car-fleet.cpp][0853-car-fleet.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/car-fleet/][car-fleet/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Pr6T-3yB9RM][explanation]]
|
|
|
|
|
** TODO 0084. Largest Rectangle In Histogram :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0084-largest-rectangle-in-histogram.py][0084-largest-rectangle-in-histogram.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0084-largest-rectangle-in-histogram.cpp][0084-largest-rectangle-in-histogram.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/largest-rectangle-in-histogram/][largest-rectangle-in-histogram/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=zx5Sw9130L0][explanation]]
|
|
|
|
|
** TODO 0726. Number of Atoms :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0726-number-of-atoms.py][0726-number-of-atoms.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0726-number-of-atoms.cpp][0726-number-of-atoms.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/number-of-atoms/][number-of-atoms/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=iuK05gGBzJc][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Sliding Window [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0121. Best Time to Buy And Sell Stock :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0121-best-time-to-buy-and-sell-stock.py][0121-best-time-to-buy-and-sell-stock.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0121-best-time-to-buy-and-sell-stock.cpp][0121-best-time-to-buy-and-sell-stock.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock/][best-time-to-buy-and-sell-stock/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=1pkOgXD63yU][explanation]]
|
|
|
|
|
** TODO 0003. Longest Substring Without Repeating Characters :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0003-longest-substring-without-repeating-characters.py][0003-longest-substring-without-repeating-characters.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0003-longest-substring-without-repeating-characters.cpp][0003-longest-substring-without-repeating-characters.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-substring-without-repeating-characters/][longest-substring-without-repeating-characters/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=wiGpQwVHdE0][explanation]]
|
|
|
|
|
** TODO 0424. Longest Repeating Character Replacement :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0424-longest-repeating-character-replacement.py][0424-longest-repeating-character-replacement.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0424-longest-repeating-character-replacement.cpp][0424-longest-repeating-character-replacement.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-repeating-character-replacement/][longest-repeating-character-replacement/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=gqXU1UyA8pk][explanation]]
|
|
|
|
|
** TODO 0567. Permutation In String :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0567-permutation-in-string.py][0567-permutation-in-string.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0567-permutation-in-string.cpp][0567-permutation-in-string.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/permutation-in-string/][permutation-in-string/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=UbyhOgBN834][explanation]]
|
|
|
|
|
** TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/][count-of-substrings-containing-every-vowel-and-k-consonants-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=2wANakxRZNo][explanation]]
|
|
|
|
|
** TODO 0076. Minimum Window Substring :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0076-minimum-window-substring.py][0076-minimum-window-substring.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0076-minimum-window-substring.cpp][0076-minimum-window-substring.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/minimum-window-substring/][minimum-window-substring/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=jSto0O4AJbM][explanation]]
|
|
|
|
|
** TODO 0239. Sliding Window Maximum :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0239-sliding-window-maximum.py][0239-sliding-window-maximum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0239-sliding-window-maximum.cpp][0239-sliding-window-maximum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/sliding-window-maximum/][sliding-window-maximum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=DfljaUwZsOk][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Linked List [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0206. Reverse Linked List :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0206-reverse-linked-list.py][0206-reverse-linked-list.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0206-reverse-linked-list.cpp][0206-reverse-linked-list.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reverse-linked-list/][reverse-linked-list/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=G0_I-ZF0S38][explanation]]
|
|
|
|
|
** TODO 0021. Merge Two Sorted Lists :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0021-merge-two-sorted-lists.py][0021-merge-two-sorted-lists.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0021-merge-two-sorted-lists.cpp][0021-merge-two-sorted-lists.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/merge-two-sorted-lists/][merge-two-sorted-lists/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XIdigk956u0][explanation]]
|
|
|
|
|
** TODO 0141. Linked List Cycle :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0141-linked-list-cycle.py][0141-linked-list-cycle.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0141-linked-list-cycle.cpp][0141-linked-list-cycle.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/linked-list-cycle/][linked-list-cycle/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=gBTe7lFR3vc][explanation]]
|
|
|
|
|
** TODO 2487. Remove Nodes From Linked List :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2487-remove-nodes-from-linked-list.py][2487-remove-nodes-from-linked-list.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2487-remove-nodes-from-linked-list.cpp][2487-remove-nodes-from-linked-list.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/remove-nodes-from-linked-list/][remove-nodes-from-linked-list/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=y783sRTezDg][explanation]]
|
|
|
|
|
** TODO 0143. Reorder List :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0143-reorder-list.py][0143-reorder-list.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0143-reorder-list.cpp][0143-reorder-list.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reorder-list/][reorder-list/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=S5bfdUTrKLM][explanation]]
|
|
|
|
|
** TODO 0019. Remove Nth Node From End of List :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0019-remove-nth-node-from-end-of-list.py][0019-remove-nth-node-from-end-of-list.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0019-remove-nth-node-from-end-of-list.cpp][0019-remove-nth-node-from-end-of-list.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/remove-nth-node-from-end-of-list/][remove-nth-node-from-end-of-list/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XVuQxVej6y8][explanation]]
|
|
|
|
|
** TODO 1721. Swapping Nodes in a Linked List :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1721-swapping-nodes-in-a-linked-list.py][1721-swapping-nodes-in-a-linked-list.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1721-swapping-nodes-in-a-linked-list.cpp][1721-swapping-nodes-in-a-linked-list.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/swapping-nodes-in-a-linked-list/][swapping-nodes-in-a-linked-list/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=4LsrgMyQIjQ][explanation]]
|
|
|
|
|
** TODO 0138. Copy List With Random Pointer :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0138-copy-list-with-random-pointer.py][0138-copy-list-with-random-pointer.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0138-copy-list-with-random-pointer.cpp][0138-copy-list-with-random-pointer.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/copy-list-with-random-pointer/][copy-list-with-random-pointer/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5Y2EiZST97Y][explanation]]
|
|
|
|
|
** TODO 1472. Design Browser History :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1472-design-browser-history.py][1472-design-browser-history.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1472-design-browser-history.cpp][1472-design-browser-history.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/design-browser-history/][design-browser-history/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=i1G-kKnBu8k][explanation]]
|
|
|
|
|
** TODO 0002. Add Two Numbers :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0002-add-two-numbers.py][0002-add-two-numbers.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0002-add-two-numbers.cpp][0002-add-two-numbers.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/add-two-numbers/][add-two-numbers/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=wgFPrzTjm7s][explanation]]
|
|
|
|
|
** TODO 0287. Find The Duplicate Number :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0287-find-the-duplicate-number.py][0287-find-the-duplicate-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0287-find-the-duplicate-number.cpp][0287-find-the-duplicate-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-the-duplicate-number/][find-the-duplicate-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=wjYnzkAhcNk][explanation]]
|
|
|
|
|
** TODO 0725. Split Linked List in Parts :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0725-split-linked-list-in-parts.py][0725-split-linked-list-in-parts.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0725-split-linked-list-in-parts.cpp][0725-split-linked-list-in-parts.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/split-linked-list-in-parts/][split-linked-list-in-parts/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=-OTlqdrxrVI][explanation]]
|
|
|
|
|
** TODO 0146. LRU Cache :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0146-lru-cache.py][0146-lru-cache.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0146-lru-cache.cpp][0146-lru-cache.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/lru-cache/][lru-cache/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=7ABFKPK2hD4][explanation]]
|
|
|
|
|
** TODO 0023. Merge K Sorted Lists :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0023-merge-k-sorted-lists.py][0023-merge-k-sorted-lists.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0023-merge-k-sorted-lists.cpp][0023-merge-k-sorted-lists.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/merge-k-sorted-lists/][merge-k-sorted-lists/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=q5a5OiGbT6Q][explanation]]
|
|
|
|
|
** TODO 0025. Reverse Nodes In K Group :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0025-reverse-nodes-in-k-group.py][0025-reverse-nodes-in-k-group.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0025-reverse-nodes-in-k-group.cpp][0025-reverse-nodes-in-k-group.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reverse-nodes-in-k-group/][reverse-nodes-in-k-group/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=1UOPsfP85V4][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Trees [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0590. N-ary Tree Postorder Traversal :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0590-n-ary-tree-postorder-traversal.py][0590-n-ary-tree-postorder-traversal.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0590-n-ary-tree-postorder-traversal.cpp][0590-n-ary-tree-postorder-traversal.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/n-ary-tree-postorder-traversal/][n-ary-tree-postorder-traversal/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=GMUI91_pDmM][explanation]]
|
|
|
|
|
** TODO 0226. Invert Binary Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0226-invert-binary-tree.py][0226-invert-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0226-invert-binary-tree.cpp][0226-invert-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/invert-binary-tree/][invert-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=OnSn2XEQ4MY][explanation]]
|
|
|
|
|
** TODO 0104. Maximum Depth of Binary Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0104-maximum-depth-of-binary-tree.py][0104-maximum-depth-of-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0104-maximum-depth-of-binary-tree.cpp][0104-maximum-depth-of-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/maximum-depth-of-binary-tree/][maximum-depth-of-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=hTM3phVI6YQ][explanation]]
|
|
|
|
|
** TODO 0543. Diameter of Binary Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0543-diameter-of-binary-tree.py][0543-diameter-of-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0543-diameter-of-binary-tree.cpp][0543-diameter-of-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/diameter-of-binary-tree/][diameter-of-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=K81C31ytOZE][explanation]]
|
|
|
|
|
** TODO 0110. Balanced Binary Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0110-balanced-binary-tree.py][0110-balanced-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0110-balanced-binary-tree.cpp][0110-balanced-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/balanced-binary-tree/][balanced-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=QfJsau0ItOY][explanation]]
|
|
|
|
|
** TODO 0100. Same Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0100-same-tree.py][0100-same-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0100-same-tree.cpp][0100-same-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/same-tree/][same-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=vRbbcKXCxOw][explanation]]
|
|
|
|
|
** TODO 0572. Subtree of Another Tree :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0572-subtree-of-another-tree.py][0572-subtree-of-another-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0572-subtree-of-another-tree.cpp][0572-subtree-of-another-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/subtree-of-another-tree/][subtree-of-another-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=E36O5SWp-LE][explanation]]
|
|
|
|
|
** TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0235-lowest-common-ancestor-of-a-binary-search-tree.py][0235-lowest-common-ancestor-of-a-binary-search-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0235-lowest-common-ancestor-of-a-binary-search-tree.cpp][0235-lowest-common-ancestor-of-a-binary-search-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/][lowest-common-ancestor-of-a-binary-search-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=gs2LMfuOR9k][explanation]]
|
|
|
|
|
** TODO 0102. Binary Tree Level Order Traversal :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0102-binary-tree-level-order-traversal.py][0102-binary-tree-level-order-traversal.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0102-binary-tree-level-order-traversal.cpp][0102-binary-tree-level-order-traversal.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/binary-tree-level-order-traversal/][binary-tree-level-order-traversal/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=6ZnyEApgFYg][explanation]]
|
|
|
|
|
** TODO 0199. Binary Tree Right Side View :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0199-binary-tree-right-side-view.py][0199-binary-tree-right-side-view.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0199-binary-tree-right-side-view.cpp][0199-binary-tree-right-side-view.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/binary-tree-right-side-view/][binary-tree-right-side-view/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=d4zLyf32e3I][explanation]]
|
|
|
|
|
** TODO 1376. Time Needed to Inform All Employees :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1376-time-needed-to-inform-all-employees.py][1376-time-needed-to-inform-all-employees.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1376-time-needed-to-inform-all-employees.cpp][1376-time-needed-to-inform-all-employees.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/time-needed-to-inform-all-employees/][time-needed-to-inform-all-employees/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=zdBYi0p4L5Q][explanation]]
|
|
|
|
|
** TODO 1448. Count Good Nodes In Binary Tree :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1448-count-good-nodes-in-binary-tree.py][1448-count-good-nodes-in-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1448-count-good-nodes-in-binary-tree.cpp][1448-count-good-nodes-in-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/count-good-nodes-in-binary-tree/][count-good-nodes-in-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=7cp5imvDzl4][explanation]]
|
|
|
|
|
** TODO 0098. Validate Binary Search Tree :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0098-validate-binary-search-tree.py][0098-validate-binary-search-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0098-validate-binary-search-tree.cpp][0098-validate-binary-search-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/validate-binary-search-tree/][validate-binary-search-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=s6ATEkipzow][explanation]]
|
|
|
|
|
** TODO 0230. Kth Smallest Element In a Bst :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0230-kth-smallest-element-in-a-bst.py][0230-kth-smallest-element-in-a-bst.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0230-kth-smallest-element-in-a-bst.cpp][0230-kth-smallest-element-in-a-bst.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/kth-smallest-element-in-a-bst/][kth-smallest-element-in-a-bst/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5LUXSvjmGCw][explanation]]
|
|
|
|
|
** TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0105-construct-binary-tree-from-preorder-and-inorder-traversal.py][0105-construct-binary-tree-from-preorder-and-inorder-traversal.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp][0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/][construct-binary-tree-from-preorder-and-inorder-traversal/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ihj4IQGZ2zc][explanation]]
|
|
|
|
|
** TODO 1028. Recover a Tree From Preorder Traversal :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1028-recover-a-tree-from-preorder-traversal.py][1028-recover-a-tree-from-preorder-traversal.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1028-recover-a-tree-from-preorder-traversal.cpp][1028-recover-a-tree-from-preorder-traversal.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/][recover-a-tree-from-preorder-traversal/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=VroH6J47kIE][explanation]]
|
|
|
|
|
** TODO 0124. Binary Tree Maximum Path Sum :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0124-binary-tree-maximum-path-sum.py][0124-binary-tree-maximum-path-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0124-binary-tree-maximum-path-sum.cpp][0124-binary-tree-maximum-path-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/binary-tree-maximum-path-sum/][binary-tree-maximum-path-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Hr5cWUld4vU][explanation]]
|
|
|
|
|
** TODO 0297. Serialize And Deserialize Binary Tree :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0297-serialize-and-deserialize-binary-tree.py][0297-serialize-and-deserialize-binary-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0297-serialize-and-deserialize-binary-tree.cpp][0297-serialize-and-deserialize-binary-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/serialize-and-deserialize-binary-tree/][serialize-and-deserialize-binary-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=u4JAi2JJhI8][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Tries [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0208. Implement Trie Prefix Tree :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0208-implement-trie-prefix-tree.py][0208-implement-trie-prefix-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0208-implement-trie-prefix-tree.cpp][0208-implement-trie-prefix-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/implement-trie-prefix-tree/][implement-trie-prefix-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=oobqoCJlHA0][explanation]]
|
|
|
|
|
** TODO 0211. Design Add And Search Words Data Structure :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0211-design-add-and-search-words-data-structure.py][0211-design-add-and-search-words-data-structure.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0211-design-add-and-search-words-data-structure.cpp][0211-design-add-and-search-words-data-structure.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/design-add-and-search-words-data-structure/][design-add-and-search-words-data-structure/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=BTf05gs_8iU][explanation]]
|
|
|
|
|
** TODO 1166. Design File System :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1166-design-file-system.py][1166-design-file-system.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1166-design-file-system.cpp][1166-design-file-system.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/design-file-system/][design-file-system/]]
|
|
|
|
|
** TODO 0212. Word Search II :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0212-word-search-ii.py][0212-word-search-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0212-word-search-ii.cpp][0212-word-search-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/word-search-ii/][word-search-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=asbcE9mZz_U][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Heap / Priority Queue [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0703. Kth Largest Element In a Stream :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0703-kth-largest-element-in-a-stream.py][0703-kth-largest-element-in-a-stream.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0703-kth-largest-element-in-a-stream.cpp][0703-kth-largest-element-in-a-stream.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-a-stream/][kth-largest-element-in-a-stream/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=hOjcdrqMoQ8][explanation]]
|
|
|
|
|
** TODO 1046. Last Stone Weight :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1046-last-stone-weight.py][1046-last-stone-weight.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1046-last-stone-weight.cpp][1046-last-stone-weight.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/last-stone-weight/][last-stone-weight/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=B-QCq79-Vfw][explanation]]
|
|
|
|
|
** TODO 0973. K Closest Points to Origin :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0973-k-closest-points-to-origin.py][0973-k-closest-points-to-origin.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0973-k-closest-points-to-origin.cpp][0973-k-closest-points-to-origin.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/k-closest-points-to-origin/][k-closest-points-to-origin/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=rI2EBUEMfTk][explanation]]
|
|
|
|
|
** TODO 0215. Kth Largest Element In An Array :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0215-kth-largest-element-in-an-array.py][0215-kth-largest-element-in-an-array.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0215-kth-largest-element-in-an-array.cpp][0215-kth-largest-element-in-an-array.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-an-array/][kth-largest-element-in-an-array/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XEmy13g1Qxc][explanation]]
|
|
|
|
|
** TODO 0621. Task Scheduler :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0621-task-scheduler.py][0621-task-scheduler.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0621-task-scheduler.cpp][0621-task-scheduler.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/task-scheduler/][task-scheduler/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=s8p8ukTyA2I][explanation]]
|
|
|
|
|
** TODO 0355. Design Twitter :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0355-design-twitter.py][0355-design-twitter.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0355-design-twitter.cpp][0355-design-twitter.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/design-twitter/][design-twitter/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=pNichitDD2E][explanation]]
|
|
|
|
|
** TODO 0295. Find Median From Data Stream :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0295-find-median-from-data-stream.py][0295-find-median-from-data-stream.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0295-find-median-from-data-stream.cpp][0295-find-median-from-data-stream.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-median-from-data-stream/][find-median-from-data-stream/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=itmhHWaHupI][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Backtracking [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 1863. Sum of All Subsets XOR Total :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1863-sum-of-all-subset-xor-totals.py][1863-sum-of-all-subset-xor-totals.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1863-sum-of-all-subset-xor-totals.cpp][1863-sum-of-all-subset-xor-totals.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/sum-of-all-subset-xor-totals/][sum-of-all-subset-xor-totals/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=LI7YR-bwNYY][explanation]]
|
|
|
|
|
** TODO 0078. Subsets :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0078-subsets.py][0078-subsets.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0078-subsets.cpp][0078-subsets.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/subsets/][subsets/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=REOH22Xwdkk][explanation]]
|
|
|
|
|
** TODO 0039. Combination Sum :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0039-combination-sum.py][0039-combination-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0039-combination-sum.cpp][0039-combination-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/combination-sum/][combination-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=GBKI9VSKdGg][explanation]]
|
|
|
|
|
** TODO 0040. Combination Sum II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0040-combination-sum-ii.py][0040-combination-sum-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0040-combination-sum-ii.cpp][0040-combination-sum-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/combination-sum-ii/][combination-sum-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=FOyRpNUSFeA][explanation]]
|
|
|
|
|
** TODO 0077. Combinations :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0077-combinations.py][0077-combinations.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0077-combinations.cpp][0077-combinations.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/combinations/][combinations/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=q0s6m7AiM7o][explanation]]
|
|
|
|
|
** TODO 0046. Permutations :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0046-permutations.py][0046-permutations.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0046-permutations.cpp][0046-permutations.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/permutations/][permutations/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=FZe0UqISmUw][explanation]]
|
|
|
|
|
** TODO 0090. Subsets II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0090-subsets-ii.py][0090-subsets-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0090-subsets-ii.cpp][0090-subsets-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/subsets-ii/][subsets-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Vn2v6ajA7U0][explanation]]
|
|
|
|
|
** TODO 0022. Generate Parentheses :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0022-generate-parentheses.py][0022-generate-parentheses.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0022-generate-parentheses.cpp][0022-generate-parentheses.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/generate-parentheses/][generate-parentheses/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=s9fokUqJ76A][explanation]]
|
|
|
|
|
** TODO 1079. Letter Tile Possibilities :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1079-letter-tile-possibilities.py][1079-letter-tile-possibilities.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1079-letter-tile-possibilities.cpp][1079-letter-tile-possibilities.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/letter-tile-possibilities/][letter-tile-possibilities/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=8FrJX-P_DnE][explanation]]
|
|
|
|
|
** TODO 0079. Word Search :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0079-word-search.py][0079-word-search.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0079-word-search.cpp][0079-word-search.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/word-search/][word-search/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=pfiQ_PS1g8E][explanation]]
|
|
|
|
|
** TODO 0131. Palindrome Partitioning :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0131-palindrome-partitioning.py][0131-palindrome-partitioning.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0131-palindrome-partitioning.cpp][0131-palindrome-partitioning.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/palindrome-partitioning/][palindrome-partitioning/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=3jvWodd7ht0][explanation]]
|
|
|
|
|
** TODO 0017. Letter Combinations of a Phone Number :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0017-letter-combinations-of-a-phone-number.py][0017-letter-combinations-of-a-phone-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0017-letter-combinations-of-a-phone-number.cpp][0017-letter-combinations-of-a-phone-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/letter-combinations-of-a-phone-number/][letter-combinations-of-a-phone-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=0snEunUacZY][explanation]]
|
|
|
|
|
** TODO 0351. Android Unlock Patterns :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0351-android-unlock-patterns.py][0351-android-unlock-patterns.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0351-android-unlock-patterns.cpp][0351-android-unlock-patterns.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/android-unlock-patterns/][android-unlock-patterns/]]
|
|
|
|
|
** TODO 0051. N Queens :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0051-n-queens.py][0051-n-queens.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0051-n-queens.cpp][0051-n-queens.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/n-queens/][n-queens/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Ph95IHmRp5M][explanation]]
|
|
|
|
|
** TODO 0052. N Queens II :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0052-n-queens-ii.py][0052-n-queens-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0052-n-queens-ii.cpp][0052-n-queens-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/n-queens-ii/][n-queens-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=nalYyLZgvCY][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Graphs [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 2924. Find Champion II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2924-find-champion-ii.py][2924-find-champion-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2924-find-champion-ii.cpp][2924-find-champion-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-champion-ii/][find-champion-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=HjSmSLPR7S4][explanation]]
|
|
|
|
|
** TODO 0200. Number of Islands :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0200-number-of-islands.py][0200-number-of-islands.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0200-number-of-islands.cpp][0200-number-of-islands.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/number-of-islands/][number-of-islands/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=pV2kpPD66nE][explanation]]
|
|
|
|
|
** TODO 0695. Max Area of Island :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0695-max-area-of-island.py][0695-max-area-of-island.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0695-max-area-of-island.cpp][0695-max-area-of-island.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/max-area-of-island/][max-area-of-island/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=iJGr1OtmH0c][explanation]]
|
|
|
|
|
** TODO 2658. Maximum Number of Fish in a Grid :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2658-maximum-number-of-fish-in-a-grid.py][2658-maximum-number-of-fish-in-a-grid.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2658-maximum-number-of-fish-in-a-grid.cpp][2658-maximum-number-of-fish-in-a-grid.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/][maximum-number-of-fish-in-a-grid/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=JhAz6CkRGHI][explanation]]
|
|
|
|
|
** TODO 0133. Clone Graph :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0133-clone-graph.py][0133-clone-graph.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0133-clone-graph.cpp][0133-clone-graph.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/clone-graph/][clone-graph/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=mQeF6bN8hMk][explanation]]
|
|
|
|
|
** TODO 0286. Walls And Gates :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0286-walls-and-gates.py][0286-walls-and-gates.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0286-walls-and-gates.cpp][0286-walls-and-gates.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/walls-and-gates/][walls-and-gates/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=e69C6xhiSQE][explanation]]
|
|
|
|
|
** TODO 0994. Rotting Oranges :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0994-rotting-oranges.py][0994-rotting-oranges.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0994-rotting-oranges.cpp][0994-rotting-oranges.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/rotting-oranges/][rotting-oranges/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=y704fEOx0s0][explanation]]
|
|
|
|
|
** TODO 1905. Count Sub Islands :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1905-count-sub-islands.py][1905-count-sub-islands.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1905-count-sub-islands.cpp][1905-count-sub-islands.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/count-sub-islands/][count-sub-islands/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=mLpW3qfbNJ8][explanation]]
|
|
|
|
|
** TODO 0417. Pacific Atlantic Water Flow :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0417-pacific-atlantic-water-flow.py][0417-pacific-atlantic-water-flow.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0417-pacific-atlantic-water-flow.cpp][0417-pacific-atlantic-water-flow.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/pacific-atlantic-water-flow/][pacific-atlantic-water-flow/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=s-VkcjHqkGI][explanation]]
|
|
|
|
|
** TODO 0130. Surrounded Regions :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0130-surrounded-regions.py][0130-surrounded-regions.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0130-surrounded-regions.cpp][0130-surrounded-regions.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/surrounded-regions/][surrounded-regions/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=9z2BunfoZ5Y][explanation]]
|
|
|
|
|
** TODO 0802. Find Eventual Safe States :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0802-find-eventual-safe-states.py][0802-find-eventual-safe-states.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0802-find-eventual-safe-states.cpp][0802-find-eventual-safe-states.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-eventual-safe-states/][find-eventual-safe-states/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Re_v0j0CRsg][explanation]]
|
|
|
|
|
** TODO 0207. Course Schedule :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0207-course-schedule.py][0207-course-schedule.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0207-course-schedule.cpp][0207-course-schedule.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/course-schedule/][course-schedule/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=EgI5nU9etnU][explanation]]
|
|
|
|
|
** TODO 0210. Course Schedule II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0210-course-schedule-ii.py][0210-course-schedule-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0210-course-schedule-ii.cpp][0210-course-schedule-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/course-schedule-ii/][course-schedule-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Akt3glAwyfY][explanation]]
|
|
|
|
|
** TODO 0261. Graph Valid Tree :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0261-graph-valid-tree.py][0261-graph-valid-tree.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0261-graph-valid-tree.cpp][0261-graph-valid-tree.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/graph-valid-tree/][graph-valid-tree/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=bXsUuownnoQ][explanation]]
|
|
|
|
|
** TODO 0323. Number of Connected Components In An Undirected Graph :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0323-number-of-connected-components-in-an-undirected-graph.py][0323-number-of-connected-components-in-an-undirected-graph.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0323-number-of-connected-components-in-an-undirected-graph.cpp][0323-number-of-connected-components-in-an-undirected-graph.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/][number-of-connected-components-in-an-undirected-graph/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=8f1XPm4WOUc][explanation]]
|
|
|
|
|
** TODO 0684. Redundant Connection :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0684-redundant-connection.py][0684-redundant-connection.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0684-redundant-connection.cpp][0684-redundant-connection.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/redundant-connection/][redundant-connection/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=1lNK80tOTfc][explanation]]
|
|
|
|
|
** TODO 2092. Find All People With Secret :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2092-find-all-people-with-secret.py][2092-find-all-people-with-secret.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2092-find-all-people-with-secret.cpp][2092-find-all-people-with-secret.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-all-people-with-secret/][find-all-people-with-secret/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=1XujGRSU1bQ][explanation]]
|
|
|
|
|
** TODO 0127. Word Ladder :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0127-word-ladder.py][0127-word-ladder.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0127-word-ladder.cpp][0127-word-ladder.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/word-ladder/][word-ladder/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=h9iTnkgv05E][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO 1-D Dynamic Programming [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0070. Climbing Stairs :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0070-climbing-stairs.py][0070-climbing-stairs.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0070-climbing-stairs.cpp][0070-climbing-stairs.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/climbing-stairs/][climbing-stairs/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Y0lT9Fck7qI][explanation]]
|
|
|
|
|
** TODO 0746. Min Cost Climbing Stairs :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0746-min-cost-climbing-stairs.py][0746-min-cost-climbing-stairs.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0746-min-cost-climbing-stairs.cpp][0746-min-cost-climbing-stairs.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/min-cost-climbing-stairs/][min-cost-climbing-stairs/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ktmzAZWkEZ0][explanation]]
|
|
|
|
|
** TODO 0198. House Robber :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0198-house-robber.py][0198-house-robber.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0198-house-robber.cpp][0198-house-robber.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/house-robber/][house-robber/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=73r3KWiEvyk][explanation]]
|
|
|
|
|
** TODO 0213. House Robber II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0213-house-robber-ii.py][0213-house-robber-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0213-house-robber-ii.cpp][0213-house-robber-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/house-robber-ii/][house-robber-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=rWAJCfYYOvM][explanation]]
|
|
|
|
|
** TODO 0005. Longest Palindromic Substring :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0005-longest-palindromic-substring.py][0005-longest-palindromic-substring.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0005-longest-palindromic-substring.cpp][0005-longest-palindromic-substring.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-palindromic-substring/][longest-palindromic-substring/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XYQecbcd6_c][explanation]]
|
|
|
|
|
** TODO 0647. Palindromic Substrings :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0647-palindromic-substrings.py][0647-palindromic-substrings.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0647-palindromic-substrings.cpp][0647-palindromic-substrings.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/palindromic-substrings/][palindromic-substrings/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=4RACzI5-du8][explanation]]
|
|
|
|
|
** TODO 0091. Decode Ways :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0091-decode-ways.py][0091-decode-ways.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0091-decode-ways.cpp][0091-decode-ways.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/decode-ways/][decode-ways/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=6aEyTjOwlJU][explanation]]
|
|
|
|
|
** TODO 0322. Coin Change :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0322-coin-change.py][0322-coin-change.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0322-coin-change.cpp][0322-coin-change.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/coin-change/][coin-change/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=H9bfqozjoqs][explanation]]
|
|
|
|
|
** TODO 0152. Maximum Product Subarray :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0152-maximum-product-subarray.py][0152-maximum-product-subarray.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0152-maximum-product-subarray.cpp][0152-maximum-product-subarray.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/maximum-product-subarray/][maximum-product-subarray/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=lXVy6YWFcRM][explanation]]
|
|
|
|
|
** TODO 0139. Word Break :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0139-word-break.py][0139-word-break.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0139-word-break.cpp][0139-word-break.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/word-break/][word-break/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Sx9NNgInc3A][explanation]]
|
|
|
|
|
** TODO 0300. Longest Increasing Subsequence :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0300-longest-increasing-subsequence.py][0300-longest-increasing-subsequence.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0300-longest-increasing-subsequence.cpp][0300-longest-increasing-subsequence.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-increasing-subsequence/][longest-increasing-subsequence/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=cjWnW0hdF1Y][explanation]]
|
|
|
|
|
** TODO 0416. Partition Equal Subset Sum :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0416-partition-equal-subset-sum.py][0416-partition-equal-subset-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0416-partition-equal-subset-sum.cpp][0416-partition-equal-subset-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/partition-equal-subset-sum/][partition-equal-subset-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=IsvocB5BJhw][explanation]]
|
|
|
|
|
** TODO 0656. Coin Path :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0656-coin-path.py][0656-coin-path.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0656-coin-path.cpp][0656-coin-path.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/coin-path/][coin-path/]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Intervals [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0057. Insert Interval :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0057-insert-interval.py][0057-insert-interval.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0057-insert-interval.cpp][0057-insert-interval.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/insert-interval/][insert-interval/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=A8NUOmlwOlM][explanation]]
|
|
|
|
|
** TODO 0056. Merge Intervals :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0056-merge-intervals.py][0056-merge-intervals.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0056-merge-intervals.cpp][0056-merge-intervals.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/merge-intervals/][merge-intervals/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=44H3cEC2fFM][explanation]]
|
|
|
|
|
** TODO 0435. Non Overlapping Intervals :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0435-non-overlapping-intervals.py][0435-non-overlapping-intervals.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0435-non-overlapping-intervals.cpp][0435-non-overlapping-intervals.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/non-overlapping-intervals/][non-overlapping-intervals/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=nONCGxWoUfM][explanation]]
|
|
|
|
|
** TODO 0986. Interval List Intersections :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0986-interval-list-intersections.py][0986-interval-list-intersections.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0986-interval-list-intersections.cpp][0986-interval-list-intersections.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/interval-list-intersections/][interval-list-intersections/]]
|
|
|
|
|
** TODO 0252. Meeting Rooms :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0252-meeting-rooms.py][0252-meeting-rooms.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0252-meeting-rooms.cpp][0252-meeting-rooms.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/meeting-rooms/][meeting-rooms/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=PaJxqZVPhbg][explanation]]
|
|
|
|
|
** TODO 0253. Meeting Rooms II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0253-meeting-rooms-ii.py][0253-meeting-rooms-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0253-meeting-rooms-ii.cpp][0253-meeting-rooms-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/meeting-rooms-ii/][meeting-rooms-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=FdzJmTCVyJU][explanation]]
|
|
|
|
|
** TODO 1851. Minimum Interval to Include Each Query :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1851-minimum-interval-to-include-each-query.py][1851-minimum-interval-to-include-each-query.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1851-minimum-interval-to-include-each-query.cpp][1851-minimum-interval-to-include-each-query.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/minimum-interval-to-include-each-query/][minimum-interval-to-include-each-query/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5hQ5WWW5awQ][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Greedy [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0945. Minimum Increment to Make Array Unique :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0945-minimum-increment-to-make-array-unique.py][0945-minimum-increment-to-make-array-unique.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0945-minimum-increment-to-make-array-unique.cpp][0945-minimum-increment-to-make-array-unique.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/minimum-increment-to-make-array-unique/][minimum-increment-to-make-array-unique/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XPPs2Wj2YSk][explanation]]
|
|
|
|
|
** TODO 0053. Maximum Subarray :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0053-maximum-subarray.py][0053-maximum-subarray.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0053-maximum-subarray.cpp][0053-maximum-subarray.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/maximum-subarray/][maximum-subarray/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5WZl3MMT0Eg][explanation]]
|
|
|
|
|
** TODO 0978. Longest Turbulent Subarray :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0978-longest-turbulent-subarray.py][0978-longest-turbulent-subarray.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0978-longest-turbulent-subarray.cpp][0978-longest-turbulent-subarray.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-turbulent-subarray/][longest-turbulent-subarray/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=V_iHUhR8Dek][explanation]]
|
|
|
|
|
** TODO 0055. Jump Game :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0055-jump-game.py][0055-jump-game.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0055-jump-game.cpp][0055-jump-game.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/jump-game/][jump-game/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Yan0cv2cLy8][explanation]]
|
|
|
|
|
** TODO 0045. Jump Game II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0045-jump-game-ii.py][0045-jump-game-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0045-jump-game-ii.cpp][0045-jump-game-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/jump-game-ii/][jump-game-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=dJ7sWiOoK7g][explanation]]
|
|
|
|
|
** TODO 1871. Jump Game VII :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1871-jump-game-vii.py][1871-jump-game-vii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1871-jump-game-vii.cpp][1871-jump-game-vii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/jump-game-vii/][jump-game-vii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=v1HpZUnQ4Yo][explanation]]
|
|
|
|
|
** TODO 0134. Gas Station :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0134-gas-station.py][0134-gas-station.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0134-gas-station.cpp][0134-gas-station.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/gas-station/][gas-station/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=lJwbPZGo05A][explanation]]
|
|
|
|
|
** TODO 0846. Hand of Straights :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0846-hand-of-straights.py][0846-hand-of-straights.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0846-hand-of-straights.cpp][0846-hand-of-straights.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/hand-of-straights/][hand-of-straights/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=amnrMCVd2YI][explanation]]
|
|
|
|
|
** TODO 1899. Merge Triplets to Form Target Triplet :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1899-merge-triplets-to-form-target-triplet.py][1899-merge-triplets-to-form-target-triplet.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1899-merge-triplets-to-form-target-triplet.cpp][1899-merge-triplets-to-form-target-triplet.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/merge-triplets-to-form-target-triplet/][merge-triplets-to-form-target-triplet/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=kShkQLQZ9K4][explanation]]
|
|
|
|
|
** TODO 0763. Partition Labels :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0763-partition-labels.py][0763-partition-labels.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0763-partition-labels.cpp][0763-partition-labels.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/partition-labels/][partition-labels/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=B7m8UmZE-vw][explanation]]
|
|
|
|
|
** TODO 0678. Valid Parenthesis String :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0678-valid-parenthesis-string.py][0678-valid-parenthesis-string.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0678-valid-parenthesis-string.cpp][0678-valid-parenthesis-string.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/valid-parenthesis-string/][valid-parenthesis-string/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=QhPdNS143Qg][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Advanced Graphs [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0743. Network Delay Time :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0743-network-delay-time.py][0743-network-delay-time.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0743-network-delay-time.cpp][0743-network-delay-time.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/network-delay-time/][network-delay-time/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=EaphyqKU4PQ][explanation]]
|
|
|
|
|
** TODO 0332. Reconstruct Itinerary :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0332-reconstruct-itinerary.py][0332-reconstruct-itinerary.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0332-reconstruct-itinerary.cpp][0332-reconstruct-itinerary.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reconstruct-itinerary/][reconstruct-itinerary/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ZyB_gQ8vqGA][explanation]]
|
|
|
|
|
** TODO 1584. Min Cost to Connect All Points :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1584-min-cost-to-connect-all-points.py][1584-min-cost-to-connect-all-points.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1584-min-cost-to-connect-all-points.cpp][1584-min-cost-to-connect-all-points.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/min-cost-to-connect-all-points/][min-cost-to-connect-all-points/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=f7JOBJIC-NA][explanation]]
|
|
|
|
|
** TODO 2812. Find the Safest Path in a Grid :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2812-find-the-safest-path-in-a-grid.py][2812-find-the-safest-path-in-a-grid.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2812-find-the-safest-path-in-a-grid.cpp][2812-find-the-safest-path-in-a-grid.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-the-safest-path-in-a-grid/][find-the-safest-path-in-a-grid/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=-5mQcNiVWTs][explanation]]
|
|
|
|
|
** TODO 0778. Swim In Rising Water :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0778-swim-in-rising-water.py][0778-swim-in-rising-water.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0778-swim-in-rising-water.cpp][0778-swim-in-rising-water.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/swim-in-rising-water/][swim-in-rising-water/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=amvrKlMLuGY][explanation]]
|
|
|
|
|
** TODO 0269. Alien Dictionary :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0269-alien-dictionary.py][0269-alien-dictionary.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0269-alien-dictionary.cpp][0269-alien-dictionary.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/alien-dictionary/][alien-dictionary/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=6kTZYvNNyps][explanation]]
|
|
|
|
|
** TODO 0787. Cheapest Flights Within K Stops :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0787-cheapest-flights-within-k-stops.py][0787-cheapest-flights-within-k-stops.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0787-cheapest-flights-within-k-stops.cpp][0787-cheapest-flights-within-k-stops.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/cheapest-flights-within-k-stops/][cheapest-flights-within-k-stops/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5eIK3zUdYmE][explanation]]
|
|
|
|
|
** TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2493-divide-nodes-into-the-maximum-number-of-groups.py][2493-divide-nodes-into-the-maximum-number-of-groups.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2493-divide-nodes-into-the-maximum-number-of-groups.cpp][2493-divide-nodes-into-the-maximum-number-of-groups.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/][divide-nodes-into-the-maximum-number-of-groups/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Gn0ADjje8Rg][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Bit Manipulation [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0136. Single Number :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0136-single-number.py][0136-single-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0136-single-number.cpp][0136-single-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/single-number/][single-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=qMPX1AOa83k][explanation]]
|
|
|
|
|
** TODO 0260. Single Number III :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0260-single-number-iii.py][0260-single-number-iii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0260-single-number-iii.cpp][0260-single-number-iii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/single-number-iii/][single-number-iii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=faoVORjd-T8][explanation]]
|
|
|
|
|
** TODO 0191. Number of 1 Bits :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0191-number-of-1-bits.py][0191-number-of-1-bits.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0191-number-of-1-bits.cpp][0191-number-of-1-bits.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/number-of-1-bits/][number-of-1-bits/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=5Km3utixwZs][explanation]]
|
|
|
|
|
** TODO 0338. Counting Bits :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0338-counting-bits.py][0338-counting-bits.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0338-counting-bits.cpp][0338-counting-bits.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/counting-bits/][counting-bits/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=RyBM56RIWrM][explanation]]
|
|
|
|
|
** TODO 2220. Minimum Bit Flips to Convert Number :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2220-minimum-bit-flips-to-convert-number.py][2220-minimum-bit-flips-to-convert-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2220-minimum-bit-flips-to-convert-number.cpp][2220-minimum-bit-flips-to-convert-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/minimum-bit-flips-to-convert-number/][minimum-bit-flips-to-convert-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=yz48myznqQY][explanation]]
|
|
|
|
|
** TODO 0190. Reverse Bits :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0190-reverse-bits.py][0190-reverse-bits.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0190-reverse-bits.cpp][0190-reverse-bits.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reverse-bits/][reverse-bits/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=UcoN6UjAI64][explanation]]
|
|
|
|
|
** TODO 0268. Missing Number :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0268-missing-number.py][0268-missing-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0268-missing-number.cpp][0268-missing-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/missing-number/][missing-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=WnPLSRLSANE][explanation]]
|
|
|
|
|
** TODO 0231. Power of Two :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0231-power-of-two.py][0231-power-of-two.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0231-power-of-two.cpp][0231-power-of-two.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/power-of-two/][power-of-two/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=H2bjttEV4Vc][explanation]]
|
|
|
|
|
** TODO 0371. Sum of Two Integers :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0371-sum-of-two-integers.py][0371-sum-of-two-integers.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0371-sum-of-two-integers.cpp][0371-sum-of-two-integers.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/sum-of-two-integers/][sum-of-two-integers/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=gVUrDV4tZfY][explanation]]
|
|
|
|
|
** TODO 0007. Reverse Integer :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0007-reverse-integer.py][0007-reverse-integer.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0007-reverse-integer.cpp][0007-reverse-integer.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/reverse-integer/][reverse-integer/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=HAgLH58IgJQ][explanation]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO Math & Geometry [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0840. Magic Squares In Grid :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0840-magic-squares-in-grid.py][0840-magic-squares-in-grid.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0840-magic-squares-in-grid.cpp][0840-magic-squares-in-grid.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/magic-squares-in-grid/][magic-squares-in-grid/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=FV52wWrivNc][explanation]]
|
|
|
|
|
** TODO 0048. Rotate Image :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0048-rotate-image.py][0048-rotate-image.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0048-rotate-image.cpp][0048-rotate-image.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/rotate-image/][rotate-image/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=fMSJSS7eO1w][explanation]]
|
|
|
|
|
** TODO 0054. Spiral Matrix :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0054-spiral-matrix.py][0054-spiral-matrix.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0054-spiral-matrix.cpp][0054-spiral-matrix.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/spiral-matrix/][spiral-matrix/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=BJnMZNwUk1M][explanation]]
|
|
|
|
|
** TODO 2326. Spiral Matrix IV :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2326-spiral-matrix-iv.py][2326-spiral-matrix-iv.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2326-spiral-matrix-iv.cpp][2326-spiral-matrix-iv.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/spiral-matrix-iv/][spiral-matrix-iv/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=sOV1nRhmsMQ][explanation]]
|
|
|
|
|
** TODO 0073. Set Matrix Zeroes :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0073-set-matrix-zeroes.py][0073-set-matrix-zeroes.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0073-set-matrix-zeroes.cpp][0073-set-matrix-zeroes.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/set-matrix-zeroes/][set-matrix-zeroes/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=T41rL0L3Pnw][explanation]]
|
|
|
|
|
** TODO 0202. Happy Number :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0202-happy-number.py][0202-happy-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0202-happy-number.cpp][0202-happy-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/happy-number/][happy-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ljz85bxOYJ0][explanation]]
|
|
|
|
|
** TODO 0066. Plus One :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0066-plus-one.py][0066-plus-one.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0066-plus-one.cpp][0066-plus-one.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/plus-one/][plus-one/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=jIaA8boiG1s][explanation]]
|
|
|
|
|
** TODO 0009. Palindrome Number :easy:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0009-palindrome-number.py][0009-palindrome-number.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0009-palindrome-number.cpp][0009-palindrome-number.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/palindrome-number/][palindrome-number/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=yubRKwixN-U][explanation]]
|
|
|
|
|
** TODO 0012. Integer to Roman :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0012-integer-to-roman.py][0012-integer-to-roman.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0012-integer-to-roman.cpp][0012-integer-to-roman.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/integer-to-roman/][integer-to-roman/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=ohBNdSJyLh8][explanation]]
|
|
|
|
|
** TODO 0050. Pow(x, n) :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0050-powx-n.py][0050-powx-n.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0050-powx-n.cpp][0050-powx-n.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/powx-n/][powx-n/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=g9YQyYi4IQQ][explanation]]
|
|
|
|
|
** TODO 2698. Find the Punishment Number of an Integer :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2698-find-the-punishment-number-of-an-integer.py][2698-find-the-punishment-number-of-an-integer.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2698-find-the-punishment-number-of-an-integer.cpp][2698-find-the-punishment-number-of-an-integer.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/find-the-punishment-number-of-an-integer/][find-the-punishment-number-of-an-integer/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=LWgksJP-5SA][explanation]]
|
|
|
|
|
** TODO 1780. Check if Number is a Sum of Powers of Three :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1780-check-if-number-is-a-sum-of-powers-of-three.py][1780-check-if-number-is-a-sum-of-powers-of-three.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1780-check-if-number-is-a-sum-of-powers-of-three.cpp][1780-check-if-number-is-a-sum-of-powers-of-three.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/][check-if-number-is-a-sum-of-powers-of-three/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=99ExTh_0Ycg][explanation]]
|
|
|
|
|
** TODO 0043. Multiply Strings :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0043-multiply-strings.py][0043-multiply-strings.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0043-multiply-strings.cpp][0043-multiply-strings.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/multiply-strings/][multiply-strings/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=1vZswirL8Y8][explanation]]
|
|
|
|
|
** TODO 2013. Detect Squares :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/2013-detect-squares.py][2013-detect-squares.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2013-detect-squares.cpp][2013-detect-squares.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/detect-squares/][detect-squares/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=bahebearrDc][explanation]]
|
|
|
|
|
** TODO 0296. Best Meeting Point :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0296-best-meeting-point.py][0296-best-meeting-point.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0296-best-meeting-point.cpp][0296-best-meeting-point.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/best-meeting-point/][best-meeting-point/]]
|
2026-06-01 02:07:20 +08:00
|
|
|
|
|
|
|
|
* TODO 2-D Dynamic Programming [/]
|
|
|
|
|
|
2026-06-01 02:22:17 +08:00
|
|
|
** TODO 0062. Unique Paths :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0062-unique-paths.py][0062-unique-paths.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0062-unique-paths.cpp][0062-unique-paths.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/unique-paths/][unique-paths/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=IlEsdxuD4lY][explanation]]
|
|
|
|
|
** TODO 1143. Longest Common Subsequence :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1143-longest-common-subsequence.py][1143-longest-common-subsequence.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1143-longest-common-subsequence.cpp][1143-longest-common-subsequence.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-common-subsequence/][longest-common-subsequence/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Ua0GhsJSlWM][explanation]]
|
|
|
|
|
** TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0309-best-time-to-buy-and-sell-stock-with-cooldown.py][0309-best-time-to-buy-and-sell-stock-with-cooldown.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp][0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/][best-time-to-buy-and-sell-stock-with-cooldown/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=I7j0F7AHpb8][explanation]]
|
|
|
|
|
** TODO 0518. Coin Change II :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0518-coin-change-ii.py][0518-coin-change-ii.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0518-coin-change-ii.cpp][0518-coin-change-ii.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/coin-change-ii/][coin-change-ii/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=Mjy4hd2xgrs][explanation]]
|
|
|
|
|
** TODO 0494. Target Sum :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0494-target-sum.py][0494-target-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0494-target-sum.cpp][0494-target-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/target-sum/][target-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=dwMOrl85Xes][explanation]]
|
|
|
|
|
** TODO 0097. Interleaving String :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0097-interleaving-string.py][0097-interleaving-string.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0097-interleaving-string.cpp][0097-interleaving-string.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/interleaving-string/][interleaving-string/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=3Rw3p9LrgvE][explanation]]
|
|
|
|
|
** TODO 0329. Longest Increasing Path In a Matrix :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0329-longest-increasing-path-in-a-matrix.py][0329-longest-increasing-path-in-a-matrix.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0329-longest-increasing-path-in-a-matrix.cpp][0329-longest-increasing-path-in-a-matrix.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/longest-increasing-path-in-a-matrix/][longest-increasing-path-in-a-matrix/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=wCc_nd-GiEc][explanation]]
|
|
|
|
|
** TODO 1911. Maximum Alternating Subsequence Sum :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1911-maximum-alternating-subsequence-sum.py][1911-maximum-alternating-subsequence-sum.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1911-maximum-alternating-subsequence-sum.cpp][1911-maximum-alternating-subsequence-sum.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/maximum-alternating-subsequence-sum/][maximum-alternating-subsequence-sum/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=4v42XOuU1XA][explanation]]
|
|
|
|
|
** TODO 0115. Distinct Subsequences :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0115-distinct-subsequences.py][0115-distinct-subsequences.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0115-distinct-subsequences.cpp][0115-distinct-subsequences.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/distinct-subsequences/][distinct-subsequences/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=-RDzMJ33nx8][explanation]]
|
|
|
|
|
** TODO 0072. Edit Distance :medium:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0072-edit-distance.py][0072-edit-distance.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0072-edit-distance.cpp][0072-edit-distance.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/edit-distance/][edit-distance/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=XYi2-LPrwm4][explanation]]
|
|
|
|
|
** TODO 1220. Count Vowels Permutation :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/1220-count-vowels-permutation.py][1220-count-vowels-permutation.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1220-count-vowels-permutation.cpp][1220-count-vowels-permutation.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/count-vowels-permutation/][count-vowels-permutation/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=VUVpTZVa7Ls][explanation]]
|
|
|
|
|
** TODO 0312. Burst Balloons :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0312-burst-balloons.py][0312-burst-balloons.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0312-burst-balloons.cpp][0312-burst-balloons.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/burst-balloons/][burst-balloons/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=VFskby7lUbw][explanation]]
|
|
|
|
|
** TODO 0010. Regular Expression Matching :hard:
|
|
|
|
|
- Python: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0010-regular-expression-matching.py][0010-regular-expression-matching.py]]
|
|
|
|
|
- C++: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0010-regular-expression-matching.cpp][0010-regular-expression-matching.cpp]]
|
|
|
|
|
- LeetCode: [[https://leetcode.com/problems/regular-expression-matching/][regular-expression-matching/]]
|
|
|
|
|
- Video: [[https://youtube.com/watch?v=HAA8mgxlov8][explanation]]
|