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