diff --git a/AGENTS.md b/AGENTS.md
index 2cd7cfc..214b5cc 100644
--- a/AGENTS.md
+++ b/AGENTS.md
@@ -34,11 +34,12 @@ Periodically review this file and suggest improvements to the user if you notice
 
 ## Subdirectories
 - `leetcode/` — NeetCode roadmap extractor (dependency graph + problem list). See `leetcode/AGENTS.md`.
-- `org/cpp/dsa/` — LeetCode solution notes, one file per problem, organized by topic (18 folders)
+- `org/study_deck_02/` — Anki study deck for NeetCode DSA problems. See `org/study_deck_02/AGENTS.md`.
+- `org/cpp/` — C++ flashcard notes (non-DSA topics: containers, iterators, etc.)
 
 ## LeetCode Workflow
-- `leetcode/out/roadmap.org` — tracker only (`**` headings, `g c c` to toggle DONE)
-- `org/cpp/dsa/<topic>/<problem>.org` — your notes, solutions, flashcards
+- `org/study_deck_02/roadmap.org` — tracker only (`**` headings, `g c c` to toggle DONE)
+- `org/study_deck_02/dsa/<topic>/<problem>.org` — your notes, solutions, flashcards
 - Each links to the other via org file links
 - Problem tags (`:easy:`, `:medium:`, `:hard:`) enable filtering with `/ t`
 
@@ -46,6 +47,7 @@ Periodically review this file and suggest improvements to the user if you notice
 <!-- AI assistant maintains this section. Keep under 20 lines. -->
 <!-- Updated automatically by /self-improve. Remove stale entries. -->
 - Branch: `master`, up to date with origin
-- Current work: `leetcode/out/roadmap.org` — NeetCode 150 roadmap as org-mode checklists (199 problems, 18 topics, Python/C++ solution links)
+- DSA notes moved from `org/cpp/dsa/` to `org/study_deck_02/dsa/`
+- All files carry `#+PROPERTY: STUDY_DECK_02` for org-anki export
 - Inbox items: binary search, `using` keyword — need cards created
-- Possible cleanup: `org/cpp/dsa/udfs.org` may be a superseded draft of `org/cpp/ufds.org`
+- Possible cleanup: `org/study_deck_02/dsa/udfs.org` may be a stale draft of `org/cpp/ufds.org`
diff --git a/leetcode/AGENTS.md b/leetcode/AGENTS.md
index 18dedf3..1af4178 100644
--- a/leetcode/AGENTS.md
+++ b/leetcode/AGENTS.md
@@ -43,7 +43,7 @@ and produce byte-identical output.
 | `out/roadmap.json` | Full data: graph, all 965 problems, courses |
 | `out/roadmap-neetcode150.json` | NeetCode 150 only (199 problems) |
 | `out/roadmap.dot` | Graphviz DOT (render with `dot -Tsvg`) |
-| `out/roadmap.org` | Org-mode with `TODO` checklists, Python/C++ links |
+| `out/roadmap.org` | Org-mode with `TODO` checklists, Python/C++ links (moved to `org/study_deck_02/roadmap.org`) |
 | `neetcode-roadmap-graph.json` | Standalone edge list (manual copy) |
 | `neetcode-roadmap.dot` | Standalone DOT (manual copy) |
 
@@ -69,19 +69,21 @@ Arrays & Hashing
 
 Each topic is a `* TODO` heading with a `[/]` cookie for progress.
 Problems are `** TODO` sub-headings with difficulty tags (`:easy:`,
-`:medium:`, `:hard:`). Python and C++ solution links are `***` sub-headings
-under each problem. Each problem also links to a notes file at
-`org/cpp/dsa/<topic>/<problem>.org` for personal solutions and flashcards.
+`:medium:`, `:hard:`). Each problem has a properties drawer with links
+to LeetCode, GitHub solutions (Python/C++), and video. A `Notes:` line
+links to the personal notes file at
+`org/study_deck_02/dsa/<topic>/<problem>.org`.
 
 ### Notes Files
 
-`org/cpp/dsa/<topic>/<code>.org` — one per NeetCode 150 problem (199 total).
+`org/study_deck_02/dsa/<topic>/<code>.org` — one per NeetCode 150 problem (199 total).
 Scaffolded by `scaffold-notes.mjs`. Template:
 
 ```org
 * TODO 0217. Contains Duplicate :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
 :END:
 
 #+begin_src cpp
diff --git a/leetcode/extract.mjs b/leetcode/extract.mjs
index dd0108f..59e2ca0 100644
--- a/leetcode/extract.mjs
+++ b/leetcode/extract.mjs
@@ -197,6 +197,7 @@ function buildOrg(sortedNodes, problemsByTopic) {
   const now = new Date().toISOString().slice(0, 10);
 
   lines.push("#+TITLE: NeetCode Roadmap");
+  lines.push("#+PROPERTY: STUDY_DECK_02");
   lines.push(`#+DATE: ${now}`);
   lines.push("#+TODO: TODO DONE");
   lines.push("#+STARTUP: overview");
@@ -213,7 +214,7 @@ function buildOrg(sortedNodes, problemsByTopic) {
       .replace(/[^a-z0-9]+/g, "-")
       .replace(/(^-|-$)/g, "");
 
-  const notesRoot = "../../org/cpp/dsa";
+  const notesRoot = "dsa";
 
   for (const node of sortedNodes) {
     const topicProblems = (problemsByTopic[node.name] || []).filter(
@@ -234,17 +235,17 @@ function buildOrg(sortedNodes, problemsByTopic) {
       const lcUrl = `${LEETCODE_BASE}${p.link}`;
       const num = p.code.split("-")[0];
       const notesFile = `${notesRoot}/${slug}/${p.code}.org`;
-      lines.push(`** TODO ${num}. ${p.name} :${tag}: [/]`);
-      lines.push(`*** TODO Python`);
-      lines.push(`- [[${GITHUB_SOLUTIONS}python/${p.code}.py][${p.code}.py]]`);
-      lines.push(`*** TODO C++`);
-      lines.push(`- [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][${p.code}.cpp]]`);
-      lines.push(`- LeetCode: [[${lcUrl}][${p.link}]]`);
+      lines.push(`** TODO ${num}. ${p.name} :${tag}:`);
+      lines.push(`:PROPERTIES:`);
+      lines.push(`:LEETCODE: [[${lcUrl}][Problem]]`);
+      lines.push(`:CPP:      [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][Solution]]`);
+      lines.push(`:PYTHON:   [[${GITHUB_SOLUTIONS}python/${p.code}.py][Solution]]`);
       if (p.video)
         lines.push(
-          `- Video: [[https://youtube.com/watch?v=${p.video}][explanation]]`
+          `:VIDEO:    [[https://youtube.com/watch?v=${p.video}][Watch]]`
         );
-      lines.push(`- Notes: [[${notesFile}][My Solution]]`);
+      lines.push(`:END:`);
+      lines.push(`Notes: [[${notesFile}][My Solution]]`);
     }
     lines.push("");
   }
@@ -343,9 +344,11 @@ async function main() {
     // DOT
     writeFileSync(join(outDir, "roadmap.dot"), buildDot(nodes), "utf8");
 
-    // Org-mode
+    // Org-mode — write to org/study_deck_02/roadmap.org
+    const orgDir = join(__dirname, "../org/study_deck_02");
+    mkdirSync(orgDir, { recursive: true });
     writeFileSync(
-      join(outDir, "roadmap.org"),
+      join(orgDir, "roadmap.org"),
       buildOrg(sorted, problemsByTopic),
       "utf8"
     );
@@ -353,7 +356,7 @@ async function main() {
     console.log(`Wrote ${outDir}/roadmap.json        (${result.stats.totalProblems} problems total)`);
     console.log(`Wrote ${outDir}/roadmap-neetcode150.json (${result.stats.neetcode150} problems)`);
     console.log(`Wrote ${outDir}/roadmap.dot`);
-    console.log(`Wrote ${outDir}/roadmap.org`);
+    console.log(`Wrote ${join(orgDir, "roadmap.org")}`);
     console.log(
       `  ${result.stats.topics} topics, ${result.stats.edges} edges`
     );
diff --git a/leetcode/out/roadmap-neetcode150.json b/leetcode/out/roadmap-neetcode150.json
index b071382..afa993a 100644
--- a/leetcode/out/roadmap-neetcode150.json
+++ b/leetcode/out/roadmap-neetcode150.json
@@ -1,6 +1,6 @@
 {
   "source": "https://neetcode.io/roadmap",
-  "extracted": "2026-05-31",
+  "extracted": "2026-06-01",
   "graph": {
     "nodes": [
       {
diff --git a/leetcode/out/roadmap.json b/leetcode/out/roadmap.json
index 261aaa4..e6c9e8a 100644
--- a/leetcode/out/roadmap.json
+++ b/leetcode/out/roadmap.json
@@ -1,6 +1,6 @@
 {
   "source": "https://neetcode.io/roadmap",
-  "extracted": "2026-05-31",
+  "extracted": "2026-06-01",
   "graph": {
     "nodes": [
       {
diff --git a/leetcode/out/roadmap.org b/leetcode/out/roadmap.org
deleted file mode 100644
index a649593..0000000
--- a/leetcode/out/roadmap.org
+++ /dev/null
@@ -1,1646 +0,0 @@
-#+TITLE: NeetCode Roadmap
-#+DATE: 2026-05-31
-#+TODO: TODO DONE
-#+STARTUP: overview
-
-Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
-
-* TODO Arrays & Hashing [/]
-
-** TODO 0217. Contains Duplicate :easy: [0/2]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0217-contains-duplicate.py][0217-contains-duplicate.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0217-contains-duplicate.cpp][0217-contains-duplicate.cpp]]
-- LeetCode: [[https://leetcode.com/problems/contains-duplicate/][contains-duplicate/]]
-- Video: [[https://youtube.com/watch?v=3OamzN90kPg][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org][My Solution]]
-** TODO 0242. Valid Anagram :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0242-valid-anagram.py][0242-valid-anagram.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][0242-valid-anagram.cpp]]
-- LeetCode: [[https://leetcode.com/problems/valid-anagram/][valid-anagram/]]
-- Video: [[https://youtube.com/watch?v=9UtInBqnCgA][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0242-valid-anagram.org][My Solution]]
-** TODO 2678. Number of Senior Citizens :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2678-number-of-senior-citizens.py][2678-number-of-senior-citizens.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2678-number-of-senior-citizens.cpp][2678-number-of-senior-citizens.cpp]]
-- LeetCode: [[https://leetcode.com/problems/number-of-senior-citizens/][number-of-senior-citizens/]]
-- Video: [[https://youtube.com/watch?v=l6_wwKzFmVo][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org][My Solution]]
-** TODO 0001. Two Sum :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0001-two-sum.py][0001-two-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0001-two-sum.cpp][0001-two-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/two-sum/][two-sum/]]
-- Video: [[https://youtube.com/watch?v=KLlXCFG5TnA][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0001-two-sum.org][My Solution]]
-** TODO 1408. String Matching in an Array :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1408-string-matching-in-an-array.py][1408-string-matching-in-an-array.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1408-string-matching-in-an-array.cpp][1408-string-matching-in-an-array.cpp]]
-- LeetCode: [[https://leetcode.com/problems/string-matching-in-an-array/][string-matching-in-an-array/]]
-- Video: [[https://youtube.com/watch?v=7K2BjgjCFDo][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org][My Solution]]
-** TODO 0049. Group Anagrams :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0049-group-anagrams.py][0049-group-anagrams.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0049-group-anagrams.cpp][0049-group-anagrams.cpp]]
-- LeetCode: [[https://leetcode.com/problems/group-anagrams/][group-anagrams/]]
-- Video: [[https://youtube.com/watch?v=vzdNOK2oB2E][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0049-group-anagrams.org][My Solution]]
-** TODO 0347. Top K Frequent Elements :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0347-top-k-frequent-elements.py][0347-top-k-frequent-elements.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0347-top-k-frequent-elements.cpp][0347-top-k-frequent-elements.cpp]]
-- LeetCode: [[https://leetcode.com/problems/top-k-frequent-elements/][top-k-frequent-elements/]]
-- Video: [[https://youtube.com/watch?v=YPTqKIgVk-k][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org][My Solution]]
-** TODO 0271. Encode and Decode Strings :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0271-encode-and-decode-strings.py][0271-encode-and-decode-strings.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0271-encode-and-decode-strings.cpp][0271-encode-and-decode-strings.cpp]]
-- LeetCode: [[https://leetcode.com/problems/encode-and-decode-strings/][encode-and-decode-strings/]]
-- Video: [[https://youtube.com/watch?v=B1k_sxOSgv8][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org][My Solution]]
-** TODO 0238. Product of Array Except Self :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0238-product-of-array-except-self.py][0238-product-of-array-except-self.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0238-product-of-array-except-self.cpp][0238-product-of-array-except-self.cpp]]
-- LeetCode: [[https://leetcode.com/problems/product-of-array-except-self/][product-of-array-except-self/]]
-- Video: [[https://youtube.com/watch?v=bNvIQI2wAjk][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org][My Solution]]
-** TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp]]
-- LeetCode: [[https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/][minimum-number-of-operations-to-move-all-balls-to-each-box/]]
-- Video: [[https://youtube.com/watch?v=ZmH3gHiIqfI][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org][My Solution]]
-** TODO 0036. Valid Sudoku :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0036-valid-sudoku.py][0036-valid-sudoku.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0036-valid-sudoku.cpp][0036-valid-sudoku.cpp]]
-- LeetCode: [[https://leetcode.com/problems/valid-sudoku/][valid-sudoku/]]
-- Video: [[https://youtube.com/watch?v=TjFXEUCMqI8][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org][My Solution]]
-** TODO 0128. Longest Consecutive Sequence :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0128-longest-consecutive-sequence.py][0128-longest-consecutive-sequence.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0128-longest-consecutive-sequence.cpp][0128-longest-consecutive-sequence.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-consecutive-sequence/][longest-consecutive-sequence/]]
-- Video: [[https://youtube.com/watch?v=P6RZZMu_maU][explanation]]
-- Notes: [[../../org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org][My Solution]]
-
-* TODO Two Pointers [/]
-
-** TODO 0344. Reverse String :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0344-reverse-string.py][0344-reverse-string.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0344-reverse-string.cpp][0344-reverse-string.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reverse-string/][reverse-string/]]
-- Video: [[https://youtube.com/watch?v=_d0T_2Lk2qA][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0344-reverse-string.org][My Solution]]
-** TODO 0125. Valid Palindrome :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0125-valid-palindrome.py][0125-valid-palindrome.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0125-valid-palindrome.cpp][0125-valid-palindrome.cpp]]
-- LeetCode: [[https://leetcode.com/problems/valid-palindrome/][valid-palindrome/]]
-- Video: [[https://youtube.com/watch?v=jJXJ16kPFWg][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0125-valid-palindrome.org][My Solution]]
-** TODO 0167. Two Sum II Input Array Is Sorted :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0167-two-sum-ii-input-array-is-sorted.py][0167-two-sum-ii-input-array-is-sorted.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0167-two-sum-ii-input-array-is-sorted.cpp][0167-two-sum-ii-input-array-is-sorted.cpp]]
-- LeetCode: [[https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/][two-sum-ii-input-array-is-sorted/]]
-- Video: [[https://youtube.com/watch?v=cQ1Oz4ckceM][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org][My Solution]]
-** TODO 0015. 3Sum :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0015-3sum.py][0015-3sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0015-3sum.cpp][0015-3sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/3sum/][3sum/]]
-- Video: [[https://youtube.com/watch?v=jzZsG8n2R9A][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0015-3sum.org][My Solution]]
-** TODO 0011. Container With Most Water :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0011-container-with-most-water.py][0011-container-with-most-water.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0011-container-with-most-water.cpp][0011-container-with-most-water.cpp]]
-- LeetCode: [[https://leetcode.com/problems/container-with-most-water/][container-with-most-water/]]
-- Video: [[https://youtube.com/watch?v=UuiTKBwPgAo][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0011-container-with-most-water.org][My Solution]]
-** TODO 0259. 3Sum Smaller :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0259-3sum-smaller.py][0259-3sum-smaller.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0259-3sum-smaller.cpp][0259-3sum-smaller.cpp]]
-- LeetCode: [[https://leetcode.com/problems/3sum-smaller/][3sum-smaller/]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0259-3sum-smaller.org][My Solution]]
-** TODO 0042. Trapping Rain Water :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0042-trapping-rain-water.py][0042-trapping-rain-water.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0042-trapping-rain-water.cpp][0042-trapping-rain-water.cpp]]
-- LeetCode: [[https://leetcode.com/problems/trapping-rain-water/][trapping-rain-water/]]
-- Video: [[https://youtube.com/watch?v=ZI2z5pq0TqA][explanation]]
-- Notes: [[../../org/cpp/dsa/two-pointers/0042-trapping-rain-water.org][My Solution]]
-
-* TODO Binary Search [/]
-
-** TODO 0704. Binary Search :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0704-binary-search.py][0704-binary-search.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0704-binary-search.cpp][0704-binary-search.cpp]]
-- LeetCode: [[https://leetcode.com/problems/binary-search/][binary-search/]]
-- Video: [[https://youtube.com/watch?v=s4DPM8ct1pI][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0704-binary-search.org][My Solution]]
-** TODO 2300. Successful Pairs of Spells and Potions :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2300-successful-pairs-of-spells-and-potions.py][2300-successful-pairs-of-spells-and-potions.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2300-successful-pairs-of-spells-and-potions.cpp][2300-successful-pairs-of-spells-and-potions.cpp]]
-- LeetCode: [[https://leetcode.com/problems/successful-pairs-of-spells-and-potions/][successful-pairs-of-spells-and-potions/]]
-- Video: [[https://youtube.com/watch?v=OKnm5oyAhWg][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org][My Solution]]
-** TODO 0074. Search a 2D Matrix :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0074-search-a-2d-matrix.py][0074-search-a-2d-matrix.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0074-search-a-2d-matrix.cpp][0074-search-a-2d-matrix.cpp]]
-- LeetCode: [[https://leetcode.com/problems/search-a-2d-matrix/][search-a-2d-matrix/]]
-- Video: [[https://youtube.com/watch?v=Ber2pi2C0j0][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org][My Solution]]
-** TODO 0875. Koko Eating Bananas :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0875-koko-eating-bananas.py][0875-koko-eating-bananas.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0875-koko-eating-bananas.cpp][0875-koko-eating-bananas.cpp]]
-- LeetCode: [[https://leetcode.com/problems/koko-eating-bananas/][koko-eating-bananas/]]
-- Video: [[https://youtube.com/watch?v=U2SozAs9RzA][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0875-koko-eating-bananas.org][My Solution]]
-** TODO 0153. Find Minimum In Rotated Sorted Array :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0153-find-minimum-in-rotated-sorted-array.py][0153-find-minimum-in-rotated-sorted-array.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0153-find-minimum-in-rotated-sorted-array.cpp][0153-find-minimum-in-rotated-sorted-array.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/][find-minimum-in-rotated-sorted-array/]]
-- Video: [[https://youtube.com/watch?v=nIVW4P8b1VA][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org][My Solution]]
-** TODO 0033. Search In Rotated Sorted Array :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0033-search-in-rotated-sorted-array.py][0033-search-in-rotated-sorted-array.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0033-search-in-rotated-sorted-array.cpp][0033-search-in-rotated-sorted-array.cpp]]
-- LeetCode: [[https://leetcode.com/problems/search-in-rotated-sorted-array/][search-in-rotated-sorted-array/]]
-- Video: [[https://youtube.com/watch?v=U8XENwh8Oy8][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org][My Solution]]
-** TODO 0981. Time Based Key Value Store :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0981-time-based-key-value-store.py][0981-time-based-key-value-store.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0981-time-based-key-value-store.cpp][0981-time-based-key-value-store.cpp]]
-- LeetCode: [[https://leetcode.com/problems/time-based-key-value-store/][time-based-key-value-store/]]
-- Video: [[https://youtube.com/watch?v=fu2cD_6E8Hw][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0981-time-based-key-value-store.org][My Solution]]
-** TODO 0719. Find K-th Smallest Pair Distance :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0719-find-k-th-smallest-pair-distance.py][0719-find-k-th-smallest-pair-distance.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0719-find-k-th-smallest-pair-distance.cpp][0719-find-k-th-smallest-pair-distance.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-k-th-smallest-pair-distance/][find-k-th-smallest-pair-distance/]]
-- Video: [[https://youtube.com/watch?v=bQ-QcFKwsZc][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org][My Solution]]
-** TODO 0004. Median of Two Sorted Arrays :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0004-median-of-two-sorted-arrays.py][0004-median-of-two-sorted-arrays.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0004-median-of-two-sorted-arrays.cpp][0004-median-of-two-sorted-arrays.cpp]]
-- LeetCode: [[https://leetcode.com/problems/median-of-two-sorted-arrays/][median-of-two-sorted-arrays/]]
-- Video: [[https://youtube.com/watch?v=q6IEA26hvXc][explanation]]
-- Notes: [[../../org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org][My Solution]]
-
-* TODO Stack [/]
-
-** TODO 0682. Baseball Game :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0682-baseball-game.py][0682-baseball-game.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0682-baseball-game.cpp][0682-baseball-game.cpp]]
-- LeetCode: [[https://leetcode.com/problems/baseball-game/][baseball-game/]]
-- Video: [[https://youtube.com/watch?v=Id_tqGdsZQI][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0682-baseball-game.org][My Solution]]
-** TODO 0020. Valid Parentheses :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0020-valid-parentheses.py][0020-valid-parentheses.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0020-valid-parentheses.cpp][0020-valid-parentheses.cpp]]
-- LeetCode: [[https://leetcode.com/problems/valid-parentheses/][valid-parentheses/]]
-- Video: [[https://youtube.com/watch?v=WTzjTskDFMg][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0020-valid-parentheses.org][My Solution]]
-** TODO 1544. Make The String Great :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1544-make-the-string-great.py][1544-make-the-string-great.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1544-make-the-string-great.cpp][1544-make-the-string-great.cpp]]
-- LeetCode: [[https://leetcode.com/problems/make-the-string-great/][make-the-string-great/]]
-- Video: [[https://youtube.com/watch?v=10tBWNjzvtw][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/1544-make-the-string-great.org][My Solution]]
-** TODO 0155. Min Stack :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0155-min-stack.py][0155-min-stack.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0155-min-stack.cpp][0155-min-stack.cpp]]
-- LeetCode: [[https://leetcode.com/problems/min-stack/][min-stack/]]
-- Video: [[https://youtube.com/watch?v=qkLl7nAwDPo][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0155-min-stack.org][My Solution]]
-** TODO 0150. Evaluate Reverse Polish Notation :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0150-evaluate-reverse-polish-notation.py][0150-evaluate-reverse-polish-notation.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0150-evaluate-reverse-polish-notation.cpp][0150-evaluate-reverse-polish-notation.cpp]]
-- LeetCode: [[https://leetcode.com/problems/evaluate-reverse-polish-notation/][evaluate-reverse-polish-notation/]]
-- Video: [[https://youtube.com/watch?v=iu0082c4HDE][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org][My Solution]]
-** TODO 0739. Daily Temperatures :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0739-daily-temperatures.py][0739-daily-temperatures.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0739-daily-temperatures.cpp][0739-daily-temperatures.cpp]]
-- LeetCode: [[https://leetcode.com/problems/daily-temperatures/][daily-temperatures/]]
-- Video: [[https://youtube.com/watch?v=cTBiBSnjO3c][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0739-daily-temperatures.org][My Solution]]
-** TODO 0901. Online Stock Span :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0901-online-stock-span.py][0901-online-stock-span.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0901-online-stock-span.cpp][0901-online-stock-span.cpp]]
-- LeetCode: [[https://leetcode.com/problems/online-stock-span/][online-stock-span/]]
-- Video: [[https://youtube.com/watch?v=slYh0ZNEqSw][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0901-online-stock-span.org][My Solution]]
-** TODO 0853. Car Fleet :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0853-car-fleet.py][0853-car-fleet.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0853-car-fleet.cpp][0853-car-fleet.cpp]]
-- LeetCode: [[https://leetcode.com/problems/car-fleet/][car-fleet/]]
-- Video: [[https://youtube.com/watch?v=Pr6T-3yB9RM][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0853-car-fleet.org][My Solution]]
-** TODO 0084. Largest Rectangle In Histogram :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0084-largest-rectangle-in-histogram.py][0084-largest-rectangle-in-histogram.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0084-largest-rectangle-in-histogram.cpp][0084-largest-rectangle-in-histogram.cpp]]
-- LeetCode: [[https://leetcode.com/problems/largest-rectangle-in-histogram/][largest-rectangle-in-histogram/]]
-- Video: [[https://youtube.com/watch?v=zx5Sw9130L0][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org][My Solution]]
-** TODO 0726. Number of Atoms :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0726-number-of-atoms.py][0726-number-of-atoms.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0726-number-of-atoms.cpp][0726-number-of-atoms.cpp]]
-- LeetCode: [[https://leetcode.com/problems/number-of-atoms/][number-of-atoms/]]
-- Video: [[https://youtube.com/watch?v=iuK05gGBzJc][explanation]]
-- Notes: [[../../org/cpp/dsa/stack/0726-number-of-atoms.org][My Solution]]
-
-* TODO Sliding Window [/]
-
-** TODO 0121. Best Time to Buy And Sell Stock :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0121-best-time-to-buy-and-sell-stock.py][0121-best-time-to-buy-and-sell-stock.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0121-best-time-to-buy-and-sell-stock.cpp][0121-best-time-to-buy-and-sell-stock.cpp]]
-- LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock/][best-time-to-buy-and-sell-stock/]]
-- Video: [[https://youtube.com/watch?v=1pkOgXD63yU][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org][My Solution]]
-** TODO 0003. Longest Substring Without Repeating Characters :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0003-longest-substring-without-repeating-characters.py][0003-longest-substring-without-repeating-characters.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0003-longest-substring-without-repeating-characters.cpp][0003-longest-substring-without-repeating-characters.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-substring-without-repeating-characters/][longest-substring-without-repeating-characters/]]
-- Video: [[https://youtube.com/watch?v=wiGpQwVHdE0][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org][My Solution]]
-** TODO 0424. Longest Repeating Character Replacement :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0424-longest-repeating-character-replacement.py][0424-longest-repeating-character-replacement.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0424-longest-repeating-character-replacement.cpp][0424-longest-repeating-character-replacement.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-repeating-character-replacement/][longest-repeating-character-replacement/]]
-- Video: [[https://youtube.com/watch?v=gqXU1UyA8pk][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org][My Solution]]
-** TODO 0567. Permutation In String :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0567-permutation-in-string.py][0567-permutation-in-string.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0567-permutation-in-string.cpp][0567-permutation-in-string.cpp]]
-- LeetCode: [[https://leetcode.com/problems/permutation-in-string/][permutation-in-string/]]
-- Video: [[https://youtube.com/watch?v=UbyhOgBN834][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0567-permutation-in-string.org][My Solution]]
-** TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/][count-of-substrings-containing-every-vowel-and-k-consonants-ii/]]
-- Video: [[https://youtube.com/watch?v=2wANakxRZNo][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org][My Solution]]
-** TODO 0076. Minimum Window Substring :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0076-minimum-window-substring.py][0076-minimum-window-substring.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0076-minimum-window-substring.cpp][0076-minimum-window-substring.cpp]]
-- LeetCode: [[https://leetcode.com/problems/minimum-window-substring/][minimum-window-substring/]]
-- Video: [[https://youtube.com/watch?v=jSto0O4AJbM][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0076-minimum-window-substring.org][My Solution]]
-** TODO 0239. Sliding Window Maximum :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0239-sliding-window-maximum.py][0239-sliding-window-maximum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0239-sliding-window-maximum.cpp][0239-sliding-window-maximum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/sliding-window-maximum/][sliding-window-maximum/]]
-- Video: [[https://youtube.com/watch?v=DfljaUwZsOk][explanation]]
-- Notes: [[../../org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org][My Solution]]
-
-* TODO Linked List [/]
-
-** TODO 0206. Reverse Linked List :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0206-reverse-linked-list.py][0206-reverse-linked-list.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0206-reverse-linked-list.cpp][0206-reverse-linked-list.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reverse-linked-list/][reverse-linked-list/]]
-- Video: [[https://youtube.com/watch?v=G0_I-ZF0S38][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0206-reverse-linked-list.org][My Solution]]
-** TODO 0021. Merge Two Sorted Lists :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0021-merge-two-sorted-lists.py][0021-merge-two-sorted-lists.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0021-merge-two-sorted-lists.cpp][0021-merge-two-sorted-lists.cpp]]
-- LeetCode: [[https://leetcode.com/problems/merge-two-sorted-lists/][merge-two-sorted-lists/]]
-- Video: [[https://youtube.com/watch?v=XIdigk956u0][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org][My Solution]]
-** TODO 0141. Linked List Cycle :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0141-linked-list-cycle.py][0141-linked-list-cycle.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0141-linked-list-cycle.cpp][0141-linked-list-cycle.cpp]]
-- LeetCode: [[https://leetcode.com/problems/linked-list-cycle/][linked-list-cycle/]]
-- Video: [[https://youtube.com/watch?v=gBTe7lFR3vc][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0141-linked-list-cycle.org][My Solution]]
-** TODO 2487. Remove Nodes From Linked List :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2487-remove-nodes-from-linked-list.py][2487-remove-nodes-from-linked-list.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2487-remove-nodes-from-linked-list.cpp][2487-remove-nodes-from-linked-list.cpp]]
-- LeetCode: [[https://leetcode.com/problems/remove-nodes-from-linked-list/][remove-nodes-from-linked-list/]]
-- Video: [[https://youtube.com/watch?v=y783sRTezDg][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org][My Solution]]
-** TODO 0143. Reorder List :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0143-reorder-list.py][0143-reorder-list.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0143-reorder-list.cpp][0143-reorder-list.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reorder-list/][reorder-list/]]
-- Video: [[https://youtube.com/watch?v=S5bfdUTrKLM][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0143-reorder-list.org][My Solution]]
-** TODO 0019. Remove Nth Node From End of List :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0019-remove-nth-node-from-end-of-list.py][0019-remove-nth-node-from-end-of-list.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0019-remove-nth-node-from-end-of-list.cpp][0019-remove-nth-node-from-end-of-list.cpp]]
-- LeetCode: [[https://leetcode.com/problems/remove-nth-node-from-end-of-list/][remove-nth-node-from-end-of-list/]]
-- Video: [[https://youtube.com/watch?v=XVuQxVej6y8][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org][My Solution]]
-** TODO 1721. Swapping Nodes in a Linked List :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1721-swapping-nodes-in-a-linked-list.py][1721-swapping-nodes-in-a-linked-list.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1721-swapping-nodes-in-a-linked-list.cpp][1721-swapping-nodes-in-a-linked-list.cpp]]
-- LeetCode: [[https://leetcode.com/problems/swapping-nodes-in-a-linked-list/][swapping-nodes-in-a-linked-list/]]
-- Video: [[https://youtube.com/watch?v=4LsrgMyQIjQ][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org][My Solution]]
-** TODO 0138. Copy List With Random Pointer :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0138-copy-list-with-random-pointer.py][0138-copy-list-with-random-pointer.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0138-copy-list-with-random-pointer.cpp][0138-copy-list-with-random-pointer.cpp]]
-- LeetCode: [[https://leetcode.com/problems/copy-list-with-random-pointer/][copy-list-with-random-pointer/]]
-- Video: [[https://youtube.com/watch?v=5Y2EiZST97Y][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org][My Solution]]
-** TODO 1472. Design Browser History :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1472-design-browser-history.py][1472-design-browser-history.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1472-design-browser-history.cpp][1472-design-browser-history.cpp]]
-- LeetCode: [[https://leetcode.com/problems/design-browser-history/][design-browser-history/]]
-- Video: [[https://youtube.com/watch?v=i1G-kKnBu8k][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/1472-design-browser-history.org][My Solution]]
-** TODO 0002. Add Two Numbers :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0002-add-two-numbers.py][0002-add-two-numbers.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0002-add-two-numbers.cpp][0002-add-two-numbers.cpp]]
-- LeetCode: [[https://leetcode.com/problems/add-two-numbers/][add-two-numbers/]]
-- Video: [[https://youtube.com/watch?v=wgFPrzTjm7s][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0002-add-two-numbers.org][My Solution]]
-** TODO 0287. Find The Duplicate Number :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0287-find-the-duplicate-number.py][0287-find-the-duplicate-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0287-find-the-duplicate-number.cpp][0287-find-the-duplicate-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-the-duplicate-number/][find-the-duplicate-number/]]
-- Video: [[https://youtube.com/watch?v=wjYnzkAhcNk][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org][My Solution]]
-** TODO 0725. Split Linked List in Parts :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0725-split-linked-list-in-parts.py][0725-split-linked-list-in-parts.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0725-split-linked-list-in-parts.cpp][0725-split-linked-list-in-parts.cpp]]
-- LeetCode: [[https://leetcode.com/problems/split-linked-list-in-parts/][split-linked-list-in-parts/]]
-- Video: [[https://youtube.com/watch?v=-OTlqdrxrVI][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org][My Solution]]
-** TODO 0146. LRU Cache :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0146-lru-cache.py][0146-lru-cache.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0146-lru-cache.cpp][0146-lru-cache.cpp]]
-- LeetCode: [[https://leetcode.com/problems/lru-cache/][lru-cache/]]
-- Video: [[https://youtube.com/watch?v=7ABFKPK2hD4][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0146-lru-cache.org][My Solution]]
-** TODO 0023. Merge K Sorted Lists :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0023-merge-k-sorted-lists.py][0023-merge-k-sorted-lists.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0023-merge-k-sorted-lists.cpp][0023-merge-k-sorted-lists.cpp]]
-- LeetCode: [[https://leetcode.com/problems/merge-k-sorted-lists/][merge-k-sorted-lists/]]
-- Video: [[https://youtube.com/watch?v=q5a5OiGbT6Q][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org][My Solution]]
-** TODO 0025. Reverse Nodes In K Group :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0025-reverse-nodes-in-k-group.py][0025-reverse-nodes-in-k-group.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0025-reverse-nodes-in-k-group.cpp][0025-reverse-nodes-in-k-group.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reverse-nodes-in-k-group/][reverse-nodes-in-k-group/]]
-- Video: [[https://youtube.com/watch?v=1UOPsfP85V4][explanation]]
-- Notes: [[../../org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org][My Solution]]
-
-* TODO Trees [/]
-
-** TODO 0590. N-ary Tree Postorder Traversal :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0590-n-ary-tree-postorder-traversal.py][0590-n-ary-tree-postorder-traversal.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0590-n-ary-tree-postorder-traversal.cpp][0590-n-ary-tree-postorder-traversal.cpp]]
-- LeetCode: [[https://leetcode.com/problems/n-ary-tree-postorder-traversal/][n-ary-tree-postorder-traversal/]]
-- Video: [[https://youtube.com/watch?v=GMUI91_pDmM][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org][My Solution]]
-** TODO 0226. Invert Binary Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0226-invert-binary-tree.py][0226-invert-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0226-invert-binary-tree.cpp][0226-invert-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/invert-binary-tree/][invert-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=OnSn2XEQ4MY][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0226-invert-binary-tree.org][My Solution]]
-** TODO 0104. Maximum Depth of Binary Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0104-maximum-depth-of-binary-tree.py][0104-maximum-depth-of-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0104-maximum-depth-of-binary-tree.cpp][0104-maximum-depth-of-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/maximum-depth-of-binary-tree/][maximum-depth-of-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=hTM3phVI6YQ][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org][My Solution]]
-** TODO 0543. Diameter of Binary Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0543-diameter-of-binary-tree.py][0543-diameter-of-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0543-diameter-of-binary-tree.cpp][0543-diameter-of-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/diameter-of-binary-tree/][diameter-of-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=K81C31ytOZE][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0543-diameter-of-binary-tree.org][My Solution]]
-** TODO 0110. Balanced Binary Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0110-balanced-binary-tree.py][0110-balanced-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0110-balanced-binary-tree.cpp][0110-balanced-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/balanced-binary-tree/][balanced-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=QfJsau0ItOY][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0110-balanced-binary-tree.org][My Solution]]
-** TODO 0100. Same Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0100-same-tree.py][0100-same-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0100-same-tree.cpp][0100-same-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/same-tree/][same-tree/]]
-- Video: [[https://youtube.com/watch?v=vRbbcKXCxOw][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0100-same-tree.org][My Solution]]
-** TODO 0572. Subtree of Another Tree :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0572-subtree-of-another-tree.py][0572-subtree-of-another-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0572-subtree-of-another-tree.cpp][0572-subtree-of-another-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/subtree-of-another-tree/][subtree-of-another-tree/]]
-- Video: [[https://youtube.com/watch?v=E36O5SWp-LE][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0572-subtree-of-another-tree.org][My Solution]]
-** TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0235-lowest-common-ancestor-of-a-binary-search-tree.py][0235-lowest-common-ancestor-of-a-binary-search-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0235-lowest-common-ancestor-of-a-binary-search-tree.cpp][0235-lowest-common-ancestor-of-a-binary-search-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/][lowest-common-ancestor-of-a-binary-search-tree/]]
-- Video: [[https://youtube.com/watch?v=gs2LMfuOR9k][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org][My Solution]]
-** TODO 0102. Binary Tree Level Order Traversal :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0102-binary-tree-level-order-traversal.py][0102-binary-tree-level-order-traversal.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0102-binary-tree-level-order-traversal.cpp][0102-binary-tree-level-order-traversal.cpp]]
-- LeetCode: [[https://leetcode.com/problems/binary-tree-level-order-traversal/][binary-tree-level-order-traversal/]]
-- Video: [[https://youtube.com/watch?v=6ZnyEApgFYg][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org][My Solution]]
-** TODO 0199. Binary Tree Right Side View :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0199-binary-tree-right-side-view.py][0199-binary-tree-right-side-view.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0199-binary-tree-right-side-view.cpp][0199-binary-tree-right-side-view.cpp]]
-- LeetCode: [[https://leetcode.com/problems/binary-tree-right-side-view/][binary-tree-right-side-view/]]
-- Video: [[https://youtube.com/watch?v=d4zLyf32e3I][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0199-binary-tree-right-side-view.org][My Solution]]
-** TODO 1376. Time Needed to Inform All Employees :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1376-time-needed-to-inform-all-employees.py][1376-time-needed-to-inform-all-employees.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1376-time-needed-to-inform-all-employees.cpp][1376-time-needed-to-inform-all-employees.cpp]]
-- LeetCode: [[https://leetcode.com/problems/time-needed-to-inform-all-employees/][time-needed-to-inform-all-employees/]]
-- Video: [[https://youtube.com/watch?v=zdBYi0p4L5Q][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org][My Solution]]
-** TODO 1448. Count Good Nodes In Binary Tree :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1448-count-good-nodes-in-binary-tree.py][1448-count-good-nodes-in-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1448-count-good-nodes-in-binary-tree.cpp][1448-count-good-nodes-in-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/count-good-nodes-in-binary-tree/][count-good-nodes-in-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=7cp5imvDzl4][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org][My Solution]]
-** TODO 0098. Validate Binary Search Tree :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0098-validate-binary-search-tree.py][0098-validate-binary-search-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0098-validate-binary-search-tree.cpp][0098-validate-binary-search-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/validate-binary-search-tree/][validate-binary-search-tree/]]
-- Video: [[https://youtube.com/watch?v=s6ATEkipzow][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0098-validate-binary-search-tree.org][My Solution]]
-** TODO 0230. Kth Smallest Element In a Bst :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0230-kth-smallest-element-in-a-bst.py][0230-kth-smallest-element-in-a-bst.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0230-kth-smallest-element-in-a-bst.cpp][0230-kth-smallest-element-in-a-bst.cpp]]
-- LeetCode: [[https://leetcode.com/problems/kth-smallest-element-in-a-bst/][kth-smallest-element-in-a-bst/]]
-- Video: [[https://youtube.com/watch?v=5LUXSvjmGCw][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org][My Solution]]
-** TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0105-construct-binary-tree-from-preorder-and-inorder-traversal.py][0105-construct-binary-tree-from-preorder-and-inorder-traversal.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp][0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp]]
-- LeetCode: [[https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/][construct-binary-tree-from-preorder-and-inorder-traversal/]]
-- Video: [[https://youtube.com/watch?v=ihj4IQGZ2zc][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org][My Solution]]
-** TODO 1028. Recover a Tree From Preorder Traversal :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1028-recover-a-tree-from-preorder-traversal.py][1028-recover-a-tree-from-preorder-traversal.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1028-recover-a-tree-from-preorder-traversal.cpp][1028-recover-a-tree-from-preorder-traversal.cpp]]
-- LeetCode: [[https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/][recover-a-tree-from-preorder-traversal/]]
-- Video: [[https://youtube.com/watch?v=VroH6J47kIE][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org][My Solution]]
-** TODO 0124. Binary Tree Maximum Path Sum :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0124-binary-tree-maximum-path-sum.py][0124-binary-tree-maximum-path-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0124-binary-tree-maximum-path-sum.cpp][0124-binary-tree-maximum-path-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/binary-tree-maximum-path-sum/][binary-tree-maximum-path-sum/]]
-- Video: [[https://youtube.com/watch?v=Hr5cWUld4vU][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org][My Solution]]
-** TODO 0297. Serialize And Deserialize Binary Tree :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0297-serialize-and-deserialize-binary-tree.py][0297-serialize-and-deserialize-binary-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0297-serialize-and-deserialize-binary-tree.cpp][0297-serialize-and-deserialize-binary-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/serialize-and-deserialize-binary-tree/][serialize-and-deserialize-binary-tree/]]
-- Video: [[https://youtube.com/watch?v=u4JAi2JJhI8][explanation]]
-- Notes: [[../../org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org][My Solution]]
-
-* TODO Tries [/]
-
-** TODO 0208. Implement Trie Prefix Tree :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0208-implement-trie-prefix-tree.py][0208-implement-trie-prefix-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0208-implement-trie-prefix-tree.cpp][0208-implement-trie-prefix-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/implement-trie-prefix-tree/][implement-trie-prefix-tree/]]
-- Video: [[https://youtube.com/watch?v=oobqoCJlHA0][explanation]]
-- Notes: [[../../org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org][My Solution]]
-** TODO 0211. Design Add And Search Words Data Structure :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0211-design-add-and-search-words-data-structure.py][0211-design-add-and-search-words-data-structure.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0211-design-add-and-search-words-data-structure.cpp][0211-design-add-and-search-words-data-structure.cpp]]
-- LeetCode: [[https://leetcode.com/problems/design-add-and-search-words-data-structure/][design-add-and-search-words-data-structure/]]
-- Video: [[https://youtube.com/watch?v=BTf05gs_8iU][explanation]]
-- Notes: [[../../org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org][My Solution]]
-** TODO 1166. Design File System :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1166-design-file-system.py][1166-design-file-system.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1166-design-file-system.cpp][1166-design-file-system.cpp]]
-- LeetCode: [[https://leetcode.com/problems/design-file-system/][design-file-system/]]
-- Notes: [[../../org/cpp/dsa/tries/1166-design-file-system.org][My Solution]]
-** TODO 0212. Word Search II :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0212-word-search-ii.py][0212-word-search-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0212-word-search-ii.cpp][0212-word-search-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/word-search-ii/][word-search-ii/]]
-- Video: [[https://youtube.com/watch?v=asbcE9mZz_U][explanation]]
-- Notes: [[../../org/cpp/dsa/tries/0212-word-search-ii.org][My Solution]]
-
-* TODO Heap / Priority Queue [/]
-
-** TODO 0703. Kth Largest Element In a Stream :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0703-kth-largest-element-in-a-stream.py][0703-kth-largest-element-in-a-stream.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0703-kth-largest-element-in-a-stream.cpp][0703-kth-largest-element-in-a-stream.cpp]]
-- LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-a-stream/][kth-largest-element-in-a-stream/]]
-- Video: [[https://youtube.com/watch?v=hOjcdrqMoQ8][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org][My Solution]]
-** TODO 1046. Last Stone Weight :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1046-last-stone-weight.py][1046-last-stone-weight.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1046-last-stone-weight.cpp][1046-last-stone-weight.cpp]]
-- LeetCode: [[https://leetcode.com/problems/last-stone-weight/][last-stone-weight/]]
-- Video: [[https://youtube.com/watch?v=B-QCq79-Vfw][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org][My Solution]]
-** TODO 0973. K Closest Points to Origin :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0973-k-closest-points-to-origin.py][0973-k-closest-points-to-origin.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0973-k-closest-points-to-origin.cpp][0973-k-closest-points-to-origin.cpp]]
-- LeetCode: [[https://leetcode.com/problems/k-closest-points-to-origin/][k-closest-points-to-origin/]]
-- Video: [[https://youtube.com/watch?v=rI2EBUEMfTk][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org][My Solution]]
-** TODO 0215. Kth Largest Element In An Array :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0215-kth-largest-element-in-an-array.py][0215-kth-largest-element-in-an-array.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0215-kth-largest-element-in-an-array.cpp][0215-kth-largest-element-in-an-array.cpp]]
-- LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-an-array/][kth-largest-element-in-an-array/]]
-- Video: [[https://youtube.com/watch?v=XEmy13g1Qxc][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org][My Solution]]
-** TODO 0621. Task Scheduler :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0621-task-scheduler.py][0621-task-scheduler.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0621-task-scheduler.cpp][0621-task-scheduler.cpp]]
-- LeetCode: [[https://leetcode.com/problems/task-scheduler/][task-scheduler/]]
-- Video: [[https://youtube.com/watch?v=s8p8ukTyA2I][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org][My Solution]]
-** TODO 0355. Design Twitter :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0355-design-twitter.py][0355-design-twitter.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0355-design-twitter.cpp][0355-design-twitter.cpp]]
-- LeetCode: [[https://leetcode.com/problems/design-twitter/][design-twitter/]]
-- Video: [[https://youtube.com/watch?v=pNichitDD2E][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0355-design-twitter.org][My Solution]]
-** TODO 0295. Find Median From Data Stream :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0295-find-median-from-data-stream.py][0295-find-median-from-data-stream.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0295-find-median-from-data-stream.cpp][0295-find-median-from-data-stream.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-median-from-data-stream/][find-median-from-data-stream/]]
-- Video: [[https://youtube.com/watch?v=itmhHWaHupI][explanation]]
-- Notes: [[../../org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org][My Solution]]
-
-* TODO Backtracking [/]
-
-** TODO 1863. Sum of All Subsets XOR Total :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1863-sum-of-all-subset-xor-totals.py][1863-sum-of-all-subset-xor-totals.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1863-sum-of-all-subset-xor-totals.cpp][1863-sum-of-all-subset-xor-totals.cpp]]
-- LeetCode: [[https://leetcode.com/problems/sum-of-all-subset-xor-totals/][sum-of-all-subset-xor-totals/]]
-- Video: [[https://youtube.com/watch?v=LI7YR-bwNYY][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/1863-sum-of-all-subset-xor-totals.org][My Solution]]
-** TODO 0078. Subsets :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0078-subsets.py][0078-subsets.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0078-subsets.cpp][0078-subsets.cpp]]
-- LeetCode: [[https://leetcode.com/problems/subsets/][subsets/]]
-- Video: [[https://youtube.com/watch?v=REOH22Xwdkk][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0078-subsets.org][My Solution]]
-** TODO 0039. Combination Sum :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0039-combination-sum.py][0039-combination-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0039-combination-sum.cpp][0039-combination-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/combination-sum/][combination-sum/]]
-- Video: [[https://youtube.com/watch?v=GBKI9VSKdGg][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0039-combination-sum.org][My Solution]]
-** TODO 0040. Combination Sum II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0040-combination-sum-ii.py][0040-combination-sum-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0040-combination-sum-ii.cpp][0040-combination-sum-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/combination-sum-ii/][combination-sum-ii/]]
-- Video: [[https://youtube.com/watch?v=FOyRpNUSFeA][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0040-combination-sum-ii.org][My Solution]]
-** TODO 0077. Combinations :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0077-combinations.py][0077-combinations.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0077-combinations.cpp][0077-combinations.cpp]]
-- LeetCode: [[https://leetcode.com/problems/combinations/][combinations/]]
-- Video: [[https://youtube.com/watch?v=q0s6m7AiM7o][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0077-combinations.org][My Solution]]
-** TODO 0046. Permutations :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0046-permutations.py][0046-permutations.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0046-permutations.cpp][0046-permutations.cpp]]
-- LeetCode: [[https://leetcode.com/problems/permutations/][permutations/]]
-- Video: [[https://youtube.com/watch?v=FZe0UqISmUw][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0046-permutations.org][My Solution]]
-** TODO 0090. Subsets II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0090-subsets-ii.py][0090-subsets-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0090-subsets-ii.cpp][0090-subsets-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/subsets-ii/][subsets-ii/]]
-- Video: [[https://youtube.com/watch?v=Vn2v6ajA7U0][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0090-subsets-ii.org][My Solution]]
-** TODO 0022. Generate Parentheses :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0022-generate-parentheses.py][0022-generate-parentheses.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0022-generate-parentheses.cpp][0022-generate-parentheses.cpp]]
-- LeetCode: [[https://leetcode.com/problems/generate-parentheses/][generate-parentheses/]]
-- Video: [[https://youtube.com/watch?v=s9fokUqJ76A][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0022-generate-parentheses.org][My Solution]]
-** TODO 1079. Letter Tile Possibilities :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1079-letter-tile-possibilities.py][1079-letter-tile-possibilities.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1079-letter-tile-possibilities.cpp][1079-letter-tile-possibilities.cpp]]
-- LeetCode: [[https://leetcode.com/problems/letter-tile-possibilities/][letter-tile-possibilities/]]
-- Video: [[https://youtube.com/watch?v=8FrJX-P_DnE][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org][My Solution]]
-** TODO 0079. Word Search :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0079-word-search.py][0079-word-search.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0079-word-search.cpp][0079-word-search.cpp]]
-- LeetCode: [[https://leetcode.com/problems/word-search/][word-search/]]
-- Video: [[https://youtube.com/watch?v=pfiQ_PS1g8E][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0079-word-search.org][My Solution]]
-** TODO 0131. Palindrome Partitioning :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0131-palindrome-partitioning.py][0131-palindrome-partitioning.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0131-palindrome-partitioning.cpp][0131-palindrome-partitioning.cpp]]
-- LeetCode: [[https://leetcode.com/problems/palindrome-partitioning/][palindrome-partitioning/]]
-- Video: [[https://youtube.com/watch?v=3jvWodd7ht0][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0131-palindrome-partitioning.org][My Solution]]
-** TODO 0017. Letter Combinations of a Phone Number :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0017-letter-combinations-of-a-phone-number.py][0017-letter-combinations-of-a-phone-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0017-letter-combinations-of-a-phone-number.cpp][0017-letter-combinations-of-a-phone-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/letter-combinations-of-a-phone-number/][letter-combinations-of-a-phone-number/]]
-- Video: [[https://youtube.com/watch?v=0snEunUacZY][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org][My Solution]]
-** TODO 0351. Android Unlock Patterns :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0351-android-unlock-patterns.py][0351-android-unlock-patterns.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0351-android-unlock-patterns.cpp][0351-android-unlock-patterns.cpp]]
-- LeetCode: [[https://leetcode.com/problems/android-unlock-patterns/][android-unlock-patterns/]]
-- Notes: [[../../org/cpp/dsa/backtracking/0351-android-unlock-patterns.org][My Solution]]
-** TODO 0051. N Queens :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0051-n-queens.py][0051-n-queens.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0051-n-queens.cpp][0051-n-queens.cpp]]
-- LeetCode: [[https://leetcode.com/problems/n-queens/][n-queens/]]
-- Video: [[https://youtube.com/watch?v=Ph95IHmRp5M][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0051-n-queens.org][My Solution]]
-** TODO 0052. N Queens II :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0052-n-queens-ii.py][0052-n-queens-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0052-n-queens-ii.cpp][0052-n-queens-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/n-queens-ii/][n-queens-ii/]]
-- Video: [[https://youtube.com/watch?v=nalYyLZgvCY][explanation]]
-- Notes: [[../../org/cpp/dsa/backtracking/0052-n-queens-ii.org][My Solution]]
-
-* TODO Graphs [/]
-
-** TODO 2924. Find Champion II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2924-find-champion-ii.py][2924-find-champion-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2924-find-champion-ii.cpp][2924-find-champion-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-champion-ii/][find-champion-ii/]]
-- Video: [[https://youtube.com/watch?v=HjSmSLPR7S4][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/2924-find-champion-ii.org][My Solution]]
-** TODO 0200. Number of Islands :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0200-number-of-islands.py][0200-number-of-islands.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0200-number-of-islands.cpp][0200-number-of-islands.cpp]]
-- LeetCode: [[https://leetcode.com/problems/number-of-islands/][number-of-islands/]]
-- Video: [[https://youtube.com/watch?v=pV2kpPD66nE][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0200-number-of-islands.org][My Solution]]
-** TODO 0695. Max Area of Island :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0695-max-area-of-island.py][0695-max-area-of-island.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0695-max-area-of-island.cpp][0695-max-area-of-island.cpp]]
-- LeetCode: [[https://leetcode.com/problems/max-area-of-island/][max-area-of-island/]]
-- Video: [[https://youtube.com/watch?v=iJGr1OtmH0c][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0695-max-area-of-island.org][My Solution]]
-** TODO 2658. Maximum Number of Fish in a Grid :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2658-maximum-number-of-fish-in-a-grid.py][2658-maximum-number-of-fish-in-a-grid.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2658-maximum-number-of-fish-in-a-grid.cpp][2658-maximum-number-of-fish-in-a-grid.cpp]]
-- LeetCode: [[https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/][maximum-number-of-fish-in-a-grid/]]
-- Video: [[https://youtube.com/watch?v=JhAz6CkRGHI][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org][My Solution]]
-** TODO 0133. Clone Graph :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0133-clone-graph.py][0133-clone-graph.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0133-clone-graph.cpp][0133-clone-graph.cpp]]
-- LeetCode: [[https://leetcode.com/problems/clone-graph/][clone-graph/]]
-- Video: [[https://youtube.com/watch?v=mQeF6bN8hMk][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0133-clone-graph.org][My Solution]]
-** TODO 0286. Walls And Gates :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0286-walls-and-gates.py][0286-walls-and-gates.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0286-walls-and-gates.cpp][0286-walls-and-gates.cpp]]
-- LeetCode: [[https://leetcode.com/problems/walls-and-gates/][walls-and-gates/]]
-- Video: [[https://youtube.com/watch?v=e69C6xhiSQE][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0286-walls-and-gates.org][My Solution]]
-** TODO 0994. Rotting Oranges :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0994-rotting-oranges.py][0994-rotting-oranges.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0994-rotting-oranges.cpp][0994-rotting-oranges.cpp]]
-- LeetCode: [[https://leetcode.com/problems/rotting-oranges/][rotting-oranges/]]
-- Video: [[https://youtube.com/watch?v=y704fEOx0s0][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0994-rotting-oranges.org][My Solution]]
-** TODO 1905. Count Sub Islands :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1905-count-sub-islands.py][1905-count-sub-islands.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1905-count-sub-islands.cpp][1905-count-sub-islands.cpp]]
-- LeetCode: [[https://leetcode.com/problems/count-sub-islands/][count-sub-islands/]]
-- Video: [[https://youtube.com/watch?v=mLpW3qfbNJ8][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/1905-count-sub-islands.org][My Solution]]
-** TODO 0417. Pacific Atlantic Water Flow :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0417-pacific-atlantic-water-flow.py][0417-pacific-atlantic-water-flow.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0417-pacific-atlantic-water-flow.cpp][0417-pacific-atlantic-water-flow.cpp]]
-- LeetCode: [[https://leetcode.com/problems/pacific-atlantic-water-flow/][pacific-atlantic-water-flow/]]
-- Video: [[https://youtube.com/watch?v=s-VkcjHqkGI][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org][My Solution]]
-** TODO 0130. Surrounded Regions :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0130-surrounded-regions.py][0130-surrounded-regions.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0130-surrounded-regions.cpp][0130-surrounded-regions.cpp]]
-- LeetCode: [[https://leetcode.com/problems/surrounded-regions/][surrounded-regions/]]
-- Video: [[https://youtube.com/watch?v=9z2BunfoZ5Y][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0130-surrounded-regions.org][My Solution]]
-** TODO 0802. Find Eventual Safe States :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0802-find-eventual-safe-states.py][0802-find-eventual-safe-states.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0802-find-eventual-safe-states.cpp][0802-find-eventual-safe-states.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-eventual-safe-states/][find-eventual-safe-states/]]
-- Video: [[https://youtube.com/watch?v=Re_v0j0CRsg][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0802-find-eventual-safe-states.org][My Solution]]
-** TODO 0207. Course Schedule :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0207-course-schedule.py][0207-course-schedule.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0207-course-schedule.cpp][0207-course-schedule.cpp]]
-- LeetCode: [[https://leetcode.com/problems/course-schedule/][course-schedule/]]
-- Video: [[https://youtube.com/watch?v=EgI5nU9etnU][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0207-course-schedule.org][My Solution]]
-** TODO 0210. Course Schedule II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0210-course-schedule-ii.py][0210-course-schedule-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0210-course-schedule-ii.cpp][0210-course-schedule-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/course-schedule-ii/][course-schedule-ii/]]
-- Video: [[https://youtube.com/watch?v=Akt3glAwyfY][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0210-course-schedule-ii.org][My Solution]]
-** TODO 0261. Graph Valid Tree :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0261-graph-valid-tree.py][0261-graph-valid-tree.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0261-graph-valid-tree.cpp][0261-graph-valid-tree.cpp]]
-- LeetCode: [[https://leetcode.com/problems/graph-valid-tree/][graph-valid-tree/]]
-- Video: [[https://youtube.com/watch?v=bXsUuownnoQ][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0261-graph-valid-tree.org][My Solution]]
-** TODO 0323. Number of Connected Components In An Undirected Graph :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0323-number-of-connected-components-in-an-undirected-graph.py][0323-number-of-connected-components-in-an-undirected-graph.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0323-number-of-connected-components-in-an-undirected-graph.cpp][0323-number-of-connected-components-in-an-undirected-graph.cpp]]
-- LeetCode: [[https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/][number-of-connected-components-in-an-undirected-graph/]]
-- Video: [[https://youtube.com/watch?v=8f1XPm4WOUc][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org][My Solution]]
-** TODO 0684. Redundant Connection :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0684-redundant-connection.py][0684-redundant-connection.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0684-redundant-connection.cpp][0684-redundant-connection.cpp]]
-- LeetCode: [[https://leetcode.com/problems/redundant-connection/][redundant-connection/]]
-- Video: [[https://youtube.com/watch?v=1lNK80tOTfc][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0684-redundant-connection.org][My Solution]]
-** TODO 2092. Find All People With Secret :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2092-find-all-people-with-secret.py][2092-find-all-people-with-secret.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2092-find-all-people-with-secret.cpp][2092-find-all-people-with-secret.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-all-people-with-secret/][find-all-people-with-secret/]]
-- Video: [[https://youtube.com/watch?v=1XujGRSU1bQ][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/2092-find-all-people-with-secret.org][My Solution]]
-** TODO 0127. Word Ladder :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0127-word-ladder.py][0127-word-ladder.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0127-word-ladder.cpp][0127-word-ladder.cpp]]
-- LeetCode: [[https://leetcode.com/problems/word-ladder/][word-ladder/]]
-- Video: [[https://youtube.com/watch?v=h9iTnkgv05E][explanation]]
-- Notes: [[../../org/cpp/dsa/graphs/0127-word-ladder.org][My Solution]]
-
-* TODO 1-D Dynamic Programming [/]
-
-** TODO 0070. Climbing Stairs :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0070-climbing-stairs.py][0070-climbing-stairs.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0070-climbing-stairs.cpp][0070-climbing-stairs.cpp]]
-- LeetCode: [[https://leetcode.com/problems/climbing-stairs/][climbing-stairs/]]
-- Video: [[https://youtube.com/watch?v=Y0lT9Fck7qI][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org][My Solution]]
-** TODO 0746. Min Cost Climbing Stairs :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0746-min-cost-climbing-stairs.py][0746-min-cost-climbing-stairs.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0746-min-cost-climbing-stairs.cpp][0746-min-cost-climbing-stairs.cpp]]
-- LeetCode: [[https://leetcode.com/problems/min-cost-climbing-stairs/][min-cost-climbing-stairs/]]
-- Video: [[https://youtube.com/watch?v=ktmzAZWkEZ0][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org][My Solution]]
-** TODO 0198. House Robber :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0198-house-robber.py][0198-house-robber.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0198-house-robber.cpp][0198-house-robber.cpp]]
-- LeetCode: [[https://leetcode.com/problems/house-robber/][house-robber/]]
-- Video: [[https://youtube.com/watch?v=73r3KWiEvyk][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org][My Solution]]
-** TODO 0213. House Robber II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0213-house-robber-ii.py][0213-house-robber-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0213-house-robber-ii.cpp][0213-house-robber-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/house-robber-ii/][house-robber-ii/]]
-- Video: [[https://youtube.com/watch?v=rWAJCfYYOvM][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org][My Solution]]
-** TODO 0005. Longest Palindromic Substring :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0005-longest-palindromic-substring.py][0005-longest-palindromic-substring.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0005-longest-palindromic-substring.cpp][0005-longest-palindromic-substring.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-palindromic-substring/][longest-palindromic-substring/]]
-- Video: [[https://youtube.com/watch?v=XYQecbcd6_c][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org][My Solution]]
-** TODO 0647. Palindromic Substrings :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0647-palindromic-substrings.py][0647-palindromic-substrings.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0647-palindromic-substrings.cpp][0647-palindromic-substrings.cpp]]
-- LeetCode: [[https://leetcode.com/problems/palindromic-substrings/][palindromic-substrings/]]
-- Video: [[https://youtube.com/watch?v=4RACzI5-du8][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org][My Solution]]
-** TODO 0091. Decode Ways :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0091-decode-ways.py][0091-decode-ways.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0091-decode-ways.cpp][0091-decode-ways.cpp]]
-- LeetCode: [[https://leetcode.com/problems/decode-ways/][decode-ways/]]
-- Video: [[https://youtube.com/watch?v=6aEyTjOwlJU][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org][My Solution]]
-** TODO 0322. Coin Change :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0322-coin-change.py][0322-coin-change.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0322-coin-change.cpp][0322-coin-change.cpp]]
-- LeetCode: [[https://leetcode.com/problems/coin-change/][coin-change/]]
-- Video: [[https://youtube.com/watch?v=H9bfqozjoqs][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org][My Solution]]
-** TODO 0152. Maximum Product Subarray :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0152-maximum-product-subarray.py][0152-maximum-product-subarray.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0152-maximum-product-subarray.cpp][0152-maximum-product-subarray.cpp]]
-- LeetCode: [[https://leetcode.com/problems/maximum-product-subarray/][maximum-product-subarray/]]
-- Video: [[https://youtube.com/watch?v=lXVy6YWFcRM][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org][My Solution]]
-** TODO 0139. Word Break :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0139-word-break.py][0139-word-break.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0139-word-break.cpp][0139-word-break.cpp]]
-- LeetCode: [[https://leetcode.com/problems/word-break/][word-break/]]
-- Video: [[https://youtube.com/watch?v=Sx9NNgInc3A][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org][My Solution]]
-** TODO 0300. Longest Increasing Subsequence :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0300-longest-increasing-subsequence.py][0300-longest-increasing-subsequence.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0300-longest-increasing-subsequence.cpp][0300-longest-increasing-subsequence.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-increasing-subsequence/][longest-increasing-subsequence/]]
-- Video: [[https://youtube.com/watch?v=cjWnW0hdF1Y][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org][My Solution]]
-** TODO 0416. Partition Equal Subset Sum :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0416-partition-equal-subset-sum.py][0416-partition-equal-subset-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0416-partition-equal-subset-sum.cpp][0416-partition-equal-subset-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/partition-equal-subset-sum/][partition-equal-subset-sum/]]
-- Video: [[https://youtube.com/watch?v=IsvocB5BJhw][explanation]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org][My Solution]]
-** TODO 0656. Coin Path :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0656-coin-path.py][0656-coin-path.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0656-coin-path.cpp][0656-coin-path.cpp]]
-- LeetCode: [[https://leetcode.com/problems/coin-path/][coin-path/]]
-- Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org][My Solution]]
-
-* TODO Intervals [/]
-
-** TODO 0057. Insert Interval :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0057-insert-interval.py][0057-insert-interval.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0057-insert-interval.cpp][0057-insert-interval.cpp]]
-- LeetCode: [[https://leetcode.com/problems/insert-interval/][insert-interval/]]
-- Video: [[https://youtube.com/watch?v=A8NUOmlwOlM][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/0057-insert-interval.org][My Solution]]
-** TODO 0056. Merge Intervals :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0056-merge-intervals.py][0056-merge-intervals.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0056-merge-intervals.cpp][0056-merge-intervals.cpp]]
-- LeetCode: [[https://leetcode.com/problems/merge-intervals/][merge-intervals/]]
-- Video: [[https://youtube.com/watch?v=44H3cEC2fFM][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/0056-merge-intervals.org][My Solution]]
-** TODO 0435. Non Overlapping Intervals :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0435-non-overlapping-intervals.py][0435-non-overlapping-intervals.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0435-non-overlapping-intervals.cpp][0435-non-overlapping-intervals.cpp]]
-- LeetCode: [[https://leetcode.com/problems/non-overlapping-intervals/][non-overlapping-intervals/]]
-- Video: [[https://youtube.com/watch?v=nONCGxWoUfM][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/0435-non-overlapping-intervals.org][My Solution]]
-** TODO 0986. Interval List Intersections :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0986-interval-list-intersections.py][0986-interval-list-intersections.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0986-interval-list-intersections.cpp][0986-interval-list-intersections.cpp]]
-- LeetCode: [[https://leetcode.com/problems/interval-list-intersections/][interval-list-intersections/]]
-- Notes: [[../../org/cpp/dsa/intervals/0986-interval-list-intersections.org][My Solution]]
-** TODO 0252. Meeting Rooms :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0252-meeting-rooms.py][0252-meeting-rooms.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0252-meeting-rooms.cpp][0252-meeting-rooms.cpp]]
-- LeetCode: [[https://leetcode.com/problems/meeting-rooms/][meeting-rooms/]]
-- Video: [[https://youtube.com/watch?v=PaJxqZVPhbg][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/0252-meeting-rooms.org][My Solution]]
-** TODO 0253. Meeting Rooms II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0253-meeting-rooms-ii.py][0253-meeting-rooms-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0253-meeting-rooms-ii.cpp][0253-meeting-rooms-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/meeting-rooms-ii/][meeting-rooms-ii/]]
-- Video: [[https://youtube.com/watch?v=FdzJmTCVyJU][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/0253-meeting-rooms-ii.org][My Solution]]
-** TODO 1851. Minimum Interval to Include Each Query :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1851-minimum-interval-to-include-each-query.py][1851-minimum-interval-to-include-each-query.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1851-minimum-interval-to-include-each-query.cpp][1851-minimum-interval-to-include-each-query.cpp]]
-- LeetCode: [[https://leetcode.com/problems/minimum-interval-to-include-each-query/][minimum-interval-to-include-each-query/]]
-- Video: [[https://youtube.com/watch?v=5hQ5WWW5awQ][explanation]]
-- Notes: [[../../org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org][My Solution]]
-
-* TODO Greedy [/]
-
-** TODO 0945. Minimum Increment to Make Array Unique :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0945-minimum-increment-to-make-array-unique.py][0945-minimum-increment-to-make-array-unique.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0945-minimum-increment-to-make-array-unique.cpp][0945-minimum-increment-to-make-array-unique.cpp]]
-- LeetCode: [[https://leetcode.com/problems/minimum-increment-to-make-array-unique/][minimum-increment-to-make-array-unique/]]
-- Video: [[https://youtube.com/watch?v=XPPs2Wj2YSk][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org][My Solution]]
-** TODO 0053. Maximum Subarray :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0053-maximum-subarray.py][0053-maximum-subarray.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0053-maximum-subarray.cpp][0053-maximum-subarray.cpp]]
-- LeetCode: [[https://leetcode.com/problems/maximum-subarray/][maximum-subarray/]]
-- Video: [[https://youtube.com/watch?v=5WZl3MMT0Eg][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0053-maximum-subarray.org][My Solution]]
-** TODO 0978. Longest Turbulent Subarray :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0978-longest-turbulent-subarray.py][0978-longest-turbulent-subarray.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0978-longest-turbulent-subarray.cpp][0978-longest-turbulent-subarray.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-turbulent-subarray/][longest-turbulent-subarray/]]
-- Video: [[https://youtube.com/watch?v=V_iHUhR8Dek][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org][My Solution]]
-** TODO 0055. Jump Game :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0055-jump-game.py][0055-jump-game.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0055-jump-game.cpp][0055-jump-game.cpp]]
-- LeetCode: [[https://leetcode.com/problems/jump-game/][jump-game/]]
-- Video: [[https://youtube.com/watch?v=Yan0cv2cLy8][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0055-jump-game.org][My Solution]]
-** TODO 0045. Jump Game II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0045-jump-game-ii.py][0045-jump-game-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0045-jump-game-ii.cpp][0045-jump-game-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/jump-game-ii/][jump-game-ii/]]
-- Video: [[https://youtube.com/watch?v=dJ7sWiOoK7g][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0045-jump-game-ii.org][My Solution]]
-** TODO 1871. Jump Game VII :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1871-jump-game-vii.py][1871-jump-game-vii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1871-jump-game-vii.cpp][1871-jump-game-vii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/jump-game-vii/][jump-game-vii/]]
-- Video: [[https://youtube.com/watch?v=v1HpZUnQ4Yo][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/1871-jump-game-vii.org][My Solution]]
-** TODO 0134. Gas Station :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0134-gas-station.py][0134-gas-station.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0134-gas-station.cpp][0134-gas-station.cpp]]
-- LeetCode: [[https://leetcode.com/problems/gas-station/][gas-station/]]
-- Video: [[https://youtube.com/watch?v=lJwbPZGo05A][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0134-gas-station.org][My Solution]]
-** TODO 0846. Hand of Straights :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0846-hand-of-straights.py][0846-hand-of-straights.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0846-hand-of-straights.cpp][0846-hand-of-straights.cpp]]
-- LeetCode: [[https://leetcode.com/problems/hand-of-straights/][hand-of-straights/]]
-- Video: [[https://youtube.com/watch?v=amnrMCVd2YI][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0846-hand-of-straights.org][My Solution]]
-** TODO 1899. Merge Triplets to Form Target Triplet :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1899-merge-triplets-to-form-target-triplet.py][1899-merge-triplets-to-form-target-triplet.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1899-merge-triplets-to-form-target-triplet.cpp][1899-merge-triplets-to-form-target-triplet.cpp]]
-- LeetCode: [[https://leetcode.com/problems/merge-triplets-to-form-target-triplet/][merge-triplets-to-form-target-triplet/]]
-- Video: [[https://youtube.com/watch?v=kShkQLQZ9K4][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org][My Solution]]
-** TODO 0763. Partition Labels :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0763-partition-labels.py][0763-partition-labels.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0763-partition-labels.cpp][0763-partition-labels.cpp]]
-- LeetCode: [[https://leetcode.com/problems/partition-labels/][partition-labels/]]
-- Video: [[https://youtube.com/watch?v=B7m8UmZE-vw][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0763-partition-labels.org][My Solution]]
-** TODO 0678. Valid Parenthesis String :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0678-valid-parenthesis-string.py][0678-valid-parenthesis-string.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0678-valid-parenthesis-string.cpp][0678-valid-parenthesis-string.cpp]]
-- LeetCode: [[https://leetcode.com/problems/valid-parenthesis-string/][valid-parenthesis-string/]]
-- Video: [[https://youtube.com/watch?v=QhPdNS143Qg][explanation]]
-- Notes: [[../../org/cpp/dsa/greedy/0678-valid-parenthesis-string.org][My Solution]]
-
-* TODO Advanced Graphs [/]
-
-** TODO 0743. Network Delay Time :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0743-network-delay-time.py][0743-network-delay-time.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0743-network-delay-time.cpp][0743-network-delay-time.cpp]]
-- LeetCode: [[https://leetcode.com/problems/network-delay-time/][network-delay-time/]]
-- Video: [[https://youtube.com/watch?v=EaphyqKU4PQ][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/0743-network-delay-time.org][My Solution]]
-** TODO 0332. Reconstruct Itinerary :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0332-reconstruct-itinerary.py][0332-reconstruct-itinerary.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0332-reconstruct-itinerary.cpp][0332-reconstruct-itinerary.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reconstruct-itinerary/][reconstruct-itinerary/]]
-- Video: [[https://youtube.com/watch?v=ZyB_gQ8vqGA][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org][My Solution]]
-** TODO 1584. Min Cost to Connect All Points :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1584-min-cost-to-connect-all-points.py][1584-min-cost-to-connect-all-points.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1584-min-cost-to-connect-all-points.cpp][1584-min-cost-to-connect-all-points.cpp]]
-- LeetCode: [[https://leetcode.com/problems/min-cost-to-connect-all-points/][min-cost-to-connect-all-points/]]
-- Video: [[https://youtube.com/watch?v=f7JOBJIC-NA][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org][My Solution]]
-** TODO 2812. Find the Safest Path in a Grid :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2812-find-the-safest-path-in-a-grid.py][2812-find-the-safest-path-in-a-grid.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2812-find-the-safest-path-in-a-grid.cpp][2812-find-the-safest-path-in-a-grid.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-the-safest-path-in-a-grid/][find-the-safest-path-in-a-grid/]]
-- Video: [[https://youtube.com/watch?v=-5mQcNiVWTs][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org][My Solution]]
-** TODO 0778. Swim In Rising Water :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0778-swim-in-rising-water.py][0778-swim-in-rising-water.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0778-swim-in-rising-water.cpp][0778-swim-in-rising-water.cpp]]
-- LeetCode: [[https://leetcode.com/problems/swim-in-rising-water/][swim-in-rising-water/]]
-- Video: [[https://youtube.com/watch?v=amvrKlMLuGY][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org][My Solution]]
-** TODO 0269. Alien Dictionary :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0269-alien-dictionary.py][0269-alien-dictionary.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0269-alien-dictionary.cpp][0269-alien-dictionary.cpp]]
-- LeetCode: [[https://leetcode.com/problems/alien-dictionary/][alien-dictionary/]]
-- Video: [[https://youtube.com/watch?v=6kTZYvNNyps][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org][My Solution]]
-** TODO 0787. Cheapest Flights Within K Stops :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0787-cheapest-flights-within-k-stops.py][0787-cheapest-flights-within-k-stops.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0787-cheapest-flights-within-k-stops.cpp][0787-cheapest-flights-within-k-stops.cpp]]
-- LeetCode: [[https://leetcode.com/problems/cheapest-flights-within-k-stops/][cheapest-flights-within-k-stops/]]
-- Video: [[https://youtube.com/watch?v=5eIK3zUdYmE][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org][My Solution]]
-** TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2493-divide-nodes-into-the-maximum-number-of-groups.py][2493-divide-nodes-into-the-maximum-number-of-groups.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2493-divide-nodes-into-the-maximum-number-of-groups.cpp][2493-divide-nodes-into-the-maximum-number-of-groups.cpp]]
-- LeetCode: [[https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/][divide-nodes-into-the-maximum-number-of-groups/]]
-- Video: [[https://youtube.com/watch?v=Gn0ADjje8Rg][explanation]]
-- Notes: [[../../org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org][My Solution]]
-
-* TODO Bit Manipulation [/]
-
-** TODO 0136. Single Number :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0136-single-number.py][0136-single-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0136-single-number.cpp][0136-single-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/single-number/][single-number/]]
-- Video: [[https://youtube.com/watch?v=qMPX1AOa83k][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0136-single-number.org][My Solution]]
-** TODO 0260. Single Number III :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0260-single-number-iii.py][0260-single-number-iii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0260-single-number-iii.cpp][0260-single-number-iii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/single-number-iii/][single-number-iii/]]
-- Video: [[https://youtube.com/watch?v=faoVORjd-T8][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0260-single-number-iii.org][My Solution]]
-** TODO 0191. Number of 1 Bits :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0191-number-of-1-bits.py][0191-number-of-1-bits.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0191-number-of-1-bits.cpp][0191-number-of-1-bits.cpp]]
-- LeetCode: [[https://leetcode.com/problems/number-of-1-bits/][number-of-1-bits/]]
-- Video: [[https://youtube.com/watch?v=5Km3utixwZs][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org][My Solution]]
-** TODO 0338. Counting Bits :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0338-counting-bits.py][0338-counting-bits.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0338-counting-bits.cpp][0338-counting-bits.cpp]]
-- LeetCode: [[https://leetcode.com/problems/counting-bits/][counting-bits/]]
-- Video: [[https://youtube.com/watch?v=RyBM56RIWrM][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0338-counting-bits.org][My Solution]]
-** TODO 2220. Minimum Bit Flips to Convert Number :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2220-minimum-bit-flips-to-convert-number.py][2220-minimum-bit-flips-to-convert-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2220-minimum-bit-flips-to-convert-number.cpp][2220-minimum-bit-flips-to-convert-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/minimum-bit-flips-to-convert-number/][minimum-bit-flips-to-convert-number/]]
-- Video: [[https://youtube.com/watch?v=yz48myznqQY][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org][My Solution]]
-** TODO 0190. Reverse Bits :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0190-reverse-bits.py][0190-reverse-bits.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0190-reverse-bits.cpp][0190-reverse-bits.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reverse-bits/][reverse-bits/]]
-- Video: [[https://youtube.com/watch?v=UcoN6UjAI64][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0190-reverse-bits.org][My Solution]]
-** TODO 0268. Missing Number :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0268-missing-number.py][0268-missing-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0268-missing-number.cpp][0268-missing-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/missing-number/][missing-number/]]
-- Video: [[https://youtube.com/watch?v=WnPLSRLSANE][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0268-missing-number.org][My Solution]]
-** TODO 0231. Power of Two :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0231-power-of-two.py][0231-power-of-two.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0231-power-of-two.cpp][0231-power-of-two.cpp]]
-- LeetCode: [[https://leetcode.com/problems/power-of-two/][power-of-two/]]
-- Video: [[https://youtube.com/watch?v=H2bjttEV4Vc][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0231-power-of-two.org][My Solution]]
-** TODO 0371. Sum of Two Integers :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0371-sum-of-two-integers.py][0371-sum-of-two-integers.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0371-sum-of-two-integers.cpp][0371-sum-of-two-integers.cpp]]
-- LeetCode: [[https://leetcode.com/problems/sum-of-two-integers/][sum-of-two-integers/]]
-- Video: [[https://youtube.com/watch?v=gVUrDV4tZfY][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org][My Solution]]
-** TODO 0007. Reverse Integer :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0007-reverse-integer.py][0007-reverse-integer.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0007-reverse-integer.cpp][0007-reverse-integer.cpp]]
-- LeetCode: [[https://leetcode.com/problems/reverse-integer/][reverse-integer/]]
-- Video: [[https://youtube.com/watch?v=HAgLH58IgJQ][explanation]]
-- Notes: [[../../org/cpp/dsa/bit-manipulation/0007-reverse-integer.org][My Solution]]
-
-* TODO Math & Geometry [/]
-
-** TODO 0840. Magic Squares In Grid :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0840-magic-squares-in-grid.py][0840-magic-squares-in-grid.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0840-magic-squares-in-grid.cpp][0840-magic-squares-in-grid.cpp]]
-- LeetCode: [[https://leetcode.com/problems/magic-squares-in-grid/][magic-squares-in-grid/]]
-- Video: [[https://youtube.com/watch?v=FV52wWrivNc][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org][My Solution]]
-** TODO 0048. Rotate Image :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0048-rotate-image.py][0048-rotate-image.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0048-rotate-image.cpp][0048-rotate-image.cpp]]
-- LeetCode: [[https://leetcode.com/problems/rotate-image/][rotate-image/]]
-- Video: [[https://youtube.com/watch?v=fMSJSS7eO1w][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0048-rotate-image.org][My Solution]]
-** TODO 0054. Spiral Matrix :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0054-spiral-matrix.py][0054-spiral-matrix.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0054-spiral-matrix.cpp][0054-spiral-matrix.cpp]]
-- LeetCode: [[https://leetcode.com/problems/spiral-matrix/][spiral-matrix/]]
-- Video: [[https://youtube.com/watch?v=BJnMZNwUk1M][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0054-spiral-matrix.org][My Solution]]
-** TODO 2326. Spiral Matrix IV :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2326-spiral-matrix-iv.py][2326-spiral-matrix-iv.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2326-spiral-matrix-iv.cpp][2326-spiral-matrix-iv.cpp]]
-- LeetCode: [[https://leetcode.com/problems/spiral-matrix-iv/][spiral-matrix-iv/]]
-- Video: [[https://youtube.com/watch?v=sOV1nRhmsMQ][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org][My Solution]]
-** TODO 0073. Set Matrix Zeroes :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0073-set-matrix-zeroes.py][0073-set-matrix-zeroes.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0073-set-matrix-zeroes.cpp][0073-set-matrix-zeroes.cpp]]
-- LeetCode: [[https://leetcode.com/problems/set-matrix-zeroes/][set-matrix-zeroes/]]
-- Video: [[https://youtube.com/watch?v=T41rL0L3Pnw][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org][My Solution]]
-** TODO 0202. Happy Number :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0202-happy-number.py][0202-happy-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0202-happy-number.cpp][0202-happy-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/happy-number/][happy-number/]]
-- Video: [[https://youtube.com/watch?v=ljz85bxOYJ0][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0202-happy-number.org][My Solution]]
-** TODO 0066. Plus One :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0066-plus-one.py][0066-plus-one.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0066-plus-one.cpp][0066-plus-one.cpp]]
-- LeetCode: [[https://leetcode.com/problems/plus-one/][plus-one/]]
-- Video: [[https://youtube.com/watch?v=jIaA8boiG1s][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0066-plus-one.org][My Solution]]
-** TODO 0009. Palindrome Number :easy: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0009-palindrome-number.py][0009-palindrome-number.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0009-palindrome-number.cpp][0009-palindrome-number.cpp]]
-- LeetCode: [[https://leetcode.com/problems/palindrome-number/][palindrome-number/]]
-- Video: [[https://youtube.com/watch?v=yubRKwixN-U][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0009-palindrome-number.org][My Solution]]
-** TODO 0012. Integer to Roman :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0012-integer-to-roman.py][0012-integer-to-roman.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0012-integer-to-roman.cpp][0012-integer-to-roman.cpp]]
-- LeetCode: [[https://leetcode.com/problems/integer-to-roman/][integer-to-roman/]]
-- Video: [[https://youtube.com/watch?v=ohBNdSJyLh8][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0012-integer-to-roman.org][My Solution]]
-** TODO 0050. Pow(x, n) :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0050-powx-n.py][0050-powx-n.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0050-powx-n.cpp][0050-powx-n.cpp]]
-- LeetCode: [[https://leetcode.com/problems/powx-n/][powx-n/]]
-- Video: [[https://youtube.com/watch?v=g9YQyYi4IQQ][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0050-powx-n.org][My Solution]]
-** TODO 2698. Find the Punishment Number of an Integer :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2698-find-the-punishment-number-of-an-integer.py][2698-find-the-punishment-number-of-an-integer.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2698-find-the-punishment-number-of-an-integer.cpp][2698-find-the-punishment-number-of-an-integer.cpp]]
-- LeetCode: [[https://leetcode.com/problems/find-the-punishment-number-of-an-integer/][find-the-punishment-number-of-an-integer/]]
-- Video: [[https://youtube.com/watch?v=LWgksJP-5SA][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org][My Solution]]
-** TODO 1780. Check if Number is a Sum of Powers of Three :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1780-check-if-number-is-a-sum-of-powers-of-three.py][1780-check-if-number-is-a-sum-of-powers-of-three.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1780-check-if-number-is-a-sum-of-powers-of-three.cpp][1780-check-if-number-is-a-sum-of-powers-of-three.cpp]]
-- LeetCode: [[https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/][check-if-number-is-a-sum-of-powers-of-three/]]
-- Video: [[https://youtube.com/watch?v=99ExTh_0Ycg][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org][My Solution]]
-** TODO 0043. Multiply Strings :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0043-multiply-strings.py][0043-multiply-strings.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0043-multiply-strings.cpp][0043-multiply-strings.cpp]]
-- LeetCode: [[https://leetcode.com/problems/multiply-strings/][multiply-strings/]]
-- Video: [[https://youtube.com/watch?v=1vZswirL8Y8][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0043-multiply-strings.org][My Solution]]
-** TODO 2013. Detect Squares :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/2013-detect-squares.py][2013-detect-squares.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2013-detect-squares.cpp][2013-detect-squares.cpp]]
-- LeetCode: [[https://leetcode.com/problems/detect-squares/][detect-squares/]]
-- Video: [[https://youtube.com/watch?v=bahebearrDc][explanation]]
-- Notes: [[../../org/cpp/dsa/math-geometry/2013-detect-squares.org][My Solution]]
-** TODO 0296. Best Meeting Point :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0296-best-meeting-point.py][0296-best-meeting-point.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0296-best-meeting-point.cpp][0296-best-meeting-point.cpp]]
-- LeetCode: [[https://leetcode.com/problems/best-meeting-point/][best-meeting-point/]]
-- Notes: [[../../org/cpp/dsa/math-geometry/0296-best-meeting-point.org][My Solution]]
-
-* TODO 2-D Dynamic Programming [/]
-
-** TODO 0062. Unique Paths :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0062-unique-paths.py][0062-unique-paths.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0062-unique-paths.cpp][0062-unique-paths.cpp]]
-- LeetCode: [[https://leetcode.com/problems/unique-paths/][unique-paths/]]
-- Video: [[https://youtube.com/watch?v=IlEsdxuD4lY][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org][My Solution]]
-** TODO 1143. Longest Common Subsequence :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1143-longest-common-subsequence.py][1143-longest-common-subsequence.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1143-longest-common-subsequence.cpp][1143-longest-common-subsequence.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-common-subsequence/][longest-common-subsequence/]]
-- Video: [[https://youtube.com/watch?v=Ua0GhsJSlWM][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org][My Solution]]
-** TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0309-best-time-to-buy-and-sell-stock-with-cooldown.py][0309-best-time-to-buy-and-sell-stock-with-cooldown.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp][0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp]]
-- LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/][best-time-to-buy-and-sell-stock-with-cooldown/]]
-- Video: [[https://youtube.com/watch?v=I7j0F7AHpb8][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org][My Solution]]
-** TODO 0518. Coin Change II :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0518-coin-change-ii.py][0518-coin-change-ii.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0518-coin-change-ii.cpp][0518-coin-change-ii.cpp]]
-- LeetCode: [[https://leetcode.com/problems/coin-change-ii/][coin-change-ii/]]
-- Video: [[https://youtube.com/watch?v=Mjy4hd2xgrs][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org][My Solution]]
-** TODO 0494. Target Sum :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0494-target-sum.py][0494-target-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0494-target-sum.cpp][0494-target-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/target-sum/][target-sum/]]
-- Video: [[https://youtube.com/watch?v=dwMOrl85Xes][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org][My Solution]]
-** TODO 0097. Interleaving String :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0097-interleaving-string.py][0097-interleaving-string.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0097-interleaving-string.cpp][0097-interleaving-string.cpp]]
-- LeetCode: [[https://leetcode.com/problems/interleaving-string/][interleaving-string/]]
-- Video: [[https://youtube.com/watch?v=3Rw3p9LrgvE][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org][My Solution]]
-** TODO 0329. Longest Increasing Path In a Matrix :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0329-longest-increasing-path-in-a-matrix.py][0329-longest-increasing-path-in-a-matrix.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0329-longest-increasing-path-in-a-matrix.cpp][0329-longest-increasing-path-in-a-matrix.cpp]]
-- LeetCode: [[https://leetcode.com/problems/longest-increasing-path-in-a-matrix/][longest-increasing-path-in-a-matrix/]]
-- Video: [[https://youtube.com/watch?v=wCc_nd-GiEc][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org][My Solution]]
-** TODO 1911. Maximum Alternating Subsequence Sum :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1911-maximum-alternating-subsequence-sum.py][1911-maximum-alternating-subsequence-sum.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1911-maximum-alternating-subsequence-sum.cpp][1911-maximum-alternating-subsequence-sum.cpp]]
-- LeetCode: [[https://leetcode.com/problems/maximum-alternating-subsequence-sum/][maximum-alternating-subsequence-sum/]]
-- Video: [[https://youtube.com/watch?v=4v42XOuU1XA][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org][My Solution]]
-** TODO 0115. Distinct Subsequences :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0115-distinct-subsequences.py][0115-distinct-subsequences.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0115-distinct-subsequences.cpp][0115-distinct-subsequences.cpp]]
-- LeetCode: [[https://leetcode.com/problems/distinct-subsequences/][distinct-subsequences/]]
-- Video: [[https://youtube.com/watch?v=-RDzMJ33nx8][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org][My Solution]]
-** TODO 0072. Edit Distance :medium: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0072-edit-distance.py][0072-edit-distance.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0072-edit-distance.cpp][0072-edit-distance.cpp]]
-- LeetCode: [[https://leetcode.com/problems/edit-distance/][edit-distance/]]
-- Video: [[https://youtube.com/watch?v=XYi2-LPrwm4][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org][My Solution]]
-** TODO 1220. Count Vowels Permutation :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/1220-count-vowels-permutation.py][1220-count-vowels-permutation.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1220-count-vowels-permutation.cpp][1220-count-vowels-permutation.cpp]]
-- LeetCode: [[https://leetcode.com/problems/count-vowels-permutation/][count-vowels-permutation/]]
-- Video: [[https://youtube.com/watch?v=VUVpTZVa7Ls][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org][My Solution]]
-** TODO 0312. Burst Balloons :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0312-burst-balloons.py][0312-burst-balloons.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0312-burst-balloons.cpp][0312-burst-balloons.cpp]]
-- LeetCode: [[https://leetcode.com/problems/burst-balloons/][burst-balloons/]]
-- Video: [[https://youtube.com/watch?v=VFskby7lUbw][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org][My Solution]]
-** TODO 0010. Regular Expression Matching :hard: [/]
-*** TODO Python
-- [[https://github.com/neetcode-gh/leetcode/blob/main/python/0010-regular-expression-matching.py][0010-regular-expression-matching.py]]
-*** TODO C++
-- [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0010-regular-expression-matching.cpp][0010-regular-expression-matching.cpp]]
-- LeetCode: [[https://leetcode.com/problems/regular-expression-matching/][regular-expression-matching/]]
-- Video: [[https://youtube.com/watch?v=HAA8mgxlov8][explanation]]
-- Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org][My Solution]]
diff --git a/leetcode/scaffold-notes.mjs b/leetcode/scaffold-notes.mjs
index f02871e..ed0aa37 100644
--- a/leetcode/scaffold-notes.mjs
+++ b/leetcode/scaffold-notes.mjs
@@ -4,8 +4,8 @@ import { fileURLToPath } from "node:url";
 
 const __dirname = dirname(fileURLToPath(import.meta.url));
 
-const roadmap = readFileSync(join(__dirname, "out/roadmap.org"), "utf8");
-const dsaDir = join(__dirname, "../org/cpp/dsa");
+const roadmap = readFileSync(join(__dirname, "../org/study_deck_02/roadmap.org"), "utf8");
+const dsaDir = join(__dirname, "../org/study_deck_02/dsa");
 
 const topicSlug = (name) =>
   name
@@ -24,7 +24,7 @@ for (const line of roadmap.split("\n")) {
   }
 
   const problemMatch = line.match(
-    /^\*\* TODO (\d+)\. (.+?) :(easy|medium|hard): \[\/\]$/
+    /^\*\* TODO (\d+)\. (.+?) :(easy|medium|hard):/
   );
   if (problemMatch) {
     const [, num, name, diff] = problemMatch;
@@ -37,8 +37,9 @@ for (const line of roadmap.split("\n")) {
 
     if (existsSync(filePath)) continue;
 
-    const relPath = `../../../../leetcode/out/roadmap.org::*${num}. ${name}`;
+    const relPath = `../../roadmap.org::*${num}. ${name}`;
     const content = `* TODO ${num}. ${name} :${diff}:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
 :NEETCODE: [[${relPath}][Roadmap]]
 :END:
diff --git a/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org b/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org
deleted file mode 100644
index 9d335de..0000000
--- a/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org
+++ /dev/null
@@ -1,17 +0,0 @@
-* TODO 0049. Group Anagrams :medium:
-:PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0049. Group Anagrams][Roadmap]]
-:END:
-
-** TODO Approach
-Write your approach here.
-
-** TODO Python
-#+begin_src python
-
-#+end_src
-
-** TODO C++
-#+begin_src cpp
-
-#+end_src
diff --git a/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org b/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org
deleted file mode 100644
index f11442b..0000000
--- a/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org
+++ /dev/null
@@ -1,17 +0,0 @@
-* TODO 0138. Copy List With Random Pointer :medium:
-:PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0138. Copy List With Random Pointer][Roadmap]]
-:END:
-
-** TODO Approach
-Write your approach here.
-
-** TODO Python
-#+begin_src python
-
-#+end_src
-
-** TODO C++
-#+begin_src cpp
-
-#+end_src
diff --git a/org/study_deck_02/AGENTS.md b/org/study_deck_02/AGENTS.md
new file mode 100644
index 0000000..806e695
--- /dev/null
+++ b/org/study_deck_02/AGENTS.md
@@ -0,0 +1,123 @@
+# study_deck_02
+
+An Anki-exportable study deck for NeetCode DSA problems.
+
+## How It Works
+
+1. **Roadmap** (`roadmap.org`) — the tracker. Lists all NeetCode 150 topics
+   and problems. Toggle `TODO` → `DONE` with `g c c` in Emacs as you
+   complete each one. Progress cookies (`[/]`) show topic completion.
+
+2. **Notes** (`dsa/<topic>/<problem>.org`) — the real work. Each problem
+   has its own file with:
+   - Approach notes (write your own)
+   - Python and C++ solution stubs
+   - A `NEETCODE` property linking back to the roadmap
+
+3. **Study flow** — open roadmap.org, pick a topic, pick a problem,
+   follow the Notes link, solve it, mark it DONE in both places.
+
+## File Layout
+
+```
+org/study_deck_02/
+├── AGENTS.md                ← you are here
+├── roadmap.org              ← generated by leetcode/extract.mjs
+└── dsa/
+    ├── arrays-hashing/
+    │   ├── 0217-contains-duplicate.org
+    │   └── ...
+    ├── two-pointers/
+    ├── sliding-window/
+    ├── linked-list/
+    ├── binary-search/
+    ├── stack/
+    ├── trees/
+    ├── tries/
+    ├── heap-priority-queue/
+    ├── backtracking/
+    ├── graphs/
+    ├── advanced-graphs/
+    ├── 1-d-dynamic-programming/
+    ├── 2-d-dynamic-programming/
+    ├── greedy/
+    ├── intervals/
+    ├── math-geometry/
+    └── bit-manipulation/
+```
+
+18 topics, 199 problems (NeetCode 150).
+
+## The `#+PROPERTY: STUDY_DECK_02` Header
+
+Every `.org` file in this deck has `#+PROPERTY: STUDY_DECK_02` at the
+top. This tells org-anki which Anki deck to export into. Without it,
+the file won't be picked up by the exporter.
+
+## Roadmap Format
+
+Each problem in roadmap.org uses a properties drawer to keep links tidy:
+
+```org
+** 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:
+Notes: [[dsa/arrays-hashing/0217-contains-duplicate.org][My Solution]]
+```
+
+Properties are hidden by default in Emacs (`TAB` to cycle). The Notes
+link is always visible — that's the one you click most.
+
+## Notes Format
+
+Each problem note links back to the roadmap via the `NEETCODE` property:
+
+```org
+* TODO 0217. Contains Duplicate :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
+```
+
+## Regenerating
+
+From the `leetcode/` directory:
+
+```bash
+node extract.mjs              # fetches fresh data, writes roadmap.org here
+node scaffold-notes.mjs       # creates missing note files (skips existing)
+```
+
+Extract pulls from neetcode.io (cached in `leetcode/.cache/`). Scaffold
+is idempotent — it only creates files that don't exist yet.
+
+## Growing the Deck
+
+This deck starts with NeetCode 150. To add more:
+
+- **More problems** — edit `extract.mjs` to include `neetcode250` or
+  `blind75` flags, or remove the `neetcode150` filter entirely.
+- **Custom topics** — add new folders under `dsa/`, create notes manually.
+- **Other sources** — create new folders alongside `dsa/` (e.g.,
+  `euler/`, `advent-of-code/`) with the same `#+PROPERTY: STUDY_DECK_02`
+  header. They'll all export to the same Anki deck.
+- **Flashcards** — add `** Front` / `** Back` sections to any note
+  for Anki-style cards (see root `AGENTS.md` for format).
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
similarity index 65%
rename from org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
index 63a481e..f6b8b60 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
@@ -1,6 +1,7 @@
 * TODO 0005. Longest Palindromic Substring :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
similarity index 66%
rename from org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
index b22e651..1667b9a 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
@@ -1,6 +1,7 @@
 * TODO 0070. Climbing Stairs :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0070. Climbing Stairs][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0070. Climbing Stairs][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org
index db53608..65a171e 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org
@@ -1,6 +1,7 @@
 * TODO 0091. Decode Ways :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0091. Decode Ways][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0091. Decode Ways][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org
index b09bb16..f59ceaa 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org
@@ -1,6 +1,7 @@
 * TODO 0139. Word Break :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0139. Word Break][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0139. Word Break][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
similarity index 65%
rename from org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
index 7e2e15f..8c89206 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
@@ -1,6 +1,7 @@
 * TODO 0152. Maximum Product Subarray :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org
index 2ebebb6..724cdd1 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org
@@ -1,6 +1,7 @@
 * TODO 0198. House Robber :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0198. House Robber][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0198. House Robber][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
index 5eaa368..e00dab9 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
@@ -1,6 +1,7 @@
 * TODO 0213. House Robber II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0213. House Robber II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0213. House Robber II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
similarity index 65%
rename from org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
index 52479fc..89dfddd 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
@@ -1,6 +1,7 @@
 * TODO 0300. Longest Increasing Subsequence :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org
index 818318f..408c50c 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org
@@ -1,6 +1,7 @@
 * TODO 0322. Coin Change :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0322. Coin Change][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0322. Coin Change][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
similarity index 65%
rename from org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
index 94ffcb8..1100b73 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
@@ -1,6 +1,7 @@
 * TODO 0416. Partition Equal Subset Sum :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
similarity index 66%
rename from org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
index 6def8c9..61c5428 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
@@ -1,6 +1,7 @@
 * TODO 0647. Palindromic Substrings :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0647. Palindromic Substrings][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0647. Palindromic Substrings][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org
similarity index 67%
rename from org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org
index 5b1cdcc..5da9df8 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org
@@ -1,6 +1,7 @@
 * TODO 0656. Coin Path :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0656. Coin Path][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0656. Coin Path][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
similarity index 65%
rename from org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
rename to org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
index 6b9af36..217b3c4 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
+++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
@@ -1,6 +1,7 @@
 * TODO 0746. Min Cost Climbing Stairs :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
similarity index 65%
rename from org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
index b8fa75f..31001d3 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
@@ -1,6 +1,7 @@
 * TODO 0010. Regular Expression Matching :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0010. Regular Expression Matching][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0010. Regular Expression Matching][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org
similarity index 67%
rename from org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org
index de2aa41..88f4884 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org
@@ -1,6 +1,7 @@
 * TODO 0062. Unique Paths :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0062. Unique Paths][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0062. Unique Paths][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org
similarity index 67%
rename from org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org
index f8ede60..c738677 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org
@@ -1,6 +1,7 @@
 * TODO 0072. Edit Distance :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0072. Edit Distance][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0072. Edit Distance][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org
similarity index 66%
rename from org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org
index b74518b..c984328 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org
@@ -1,6 +1,7 @@
 * TODO 0097. Interleaving String :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0097. Interleaving String][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0097. Interleaving String][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
similarity index 66%
rename from org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
index c81e745..68e6646 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
@@ -1,6 +1,7 @@
 * TODO 0115. Distinct Subsequences :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0115. Distinct Subsequences][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0115. Distinct Subsequences][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
similarity index 64%
rename from org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
index bd61301..55dfd9b 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
@@ -1,6 +1,7 @@
 * TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org
similarity index 66%
rename from org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org
index a5751f4..cc3fc60 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org
@@ -1,6 +1,7 @@
 * TODO 0312. Burst Balloons :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0312. Burst Balloons][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0312. Burst Balloons][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
similarity index 64%
rename from org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
index 0bebdea..024eb77 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
@@ -1,6 +1,7 @@
 * TODO 0329. Longest Increasing Path In a Matrix :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org
similarity index 67%
rename from org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org
index e2a183e..38b5d4b 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org
@@ -1,6 +1,7 @@
 * TODO 0494. Target Sum :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0494. Target Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0494. Target Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
similarity index 67%
rename from org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
index 701e854..c11447f 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
@@ -1,6 +1,7 @@
 * TODO 0518. Coin Change II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0518. Coin Change II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0518. Coin Change II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
similarity index 65%
rename from org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
index 6515aac..da2ede1 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
@@ -1,6 +1,7 @@
 * TODO 1143. Longest Common Subsequence :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
similarity index 65%
rename from org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
index e69e654..ad59d9b 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
@@ -1,6 +1,7 @@
 * TODO 1220. Count Vowels Permutation :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
similarity index 64%
rename from org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
rename to org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
index dbff23a..fe28374 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
+++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
@@ -1,6 +1,7 @@
 * TODO 1911. Maximum Alternating Subsequence Sum :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org b/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org
similarity index 66%
rename from org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org
rename to org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org
index 11bde10..8513eee 100644
--- a/org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org
+++ b/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org
@@ -1,6 +1,7 @@
 * TODO 0269. Alien Dictionary :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0269. Alien Dictionary][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0269. Alien Dictionary][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org b/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org
similarity index 66%
rename from org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org
rename to org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org
index 06c71bb..6c11bf6 100644
--- a/org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org
+++ b/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org
@@ -1,6 +1,7 @@
 * TODO 0332. Reconstruct Itinerary :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/0743-network-delay-time.org b/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org
similarity index 66%
rename from org/cpp/dsa/advanced-graphs/0743-network-delay-time.org
rename to org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org
index 55103f5..aa0cf32 100644
--- a/org/cpp/dsa/advanced-graphs/0743-network-delay-time.org
+++ b/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org
@@ -1,6 +1,7 @@
 * TODO 0743. Network Delay Time :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0743. Network Delay Time][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0743. Network Delay Time][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org b/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org
similarity index 66%
rename from org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org
rename to org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org
index 5f1d55a..c58de69 100644
--- a/org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org
+++ b/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org
@@ -1,6 +1,7 @@
 * TODO 0778. Swim In Rising Water :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0778. Swim In Rising Water][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0778. Swim In Rising Water][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org b/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
similarity index 65%
rename from org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
rename to org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
index f484d2f..6cf4a37 100644
--- a/org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
+++ b/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
@@ -1,6 +1,7 @@
 * TODO 0787. Cheapest Flights Within K Stops :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org b/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
similarity index 65%
rename from org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
rename to org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
index c152837..53bfebc 100644
--- a/org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
+++ b/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
@@ -1,6 +1,7 @@
 * TODO 1584. Min Cost to Connect All Points :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org b/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
similarity index 63%
rename from org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
rename to org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
index 2d189ba..32a4e85 100644
--- a/org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
+++ b/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
@@ -1,6 +1,7 @@
 * TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org b/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
similarity index 65%
rename from org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
rename to org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
index ed0419c..65ce424 100644
--- a/org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
+++ b/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
@@ -1,6 +1,7 @@
 * TODO 2812. Find the Safest Path in a Grid :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0001-two-sum.org b/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org
similarity index 67%
rename from org/cpp/dsa/arrays-hashing/0001-two-sum.org
rename to org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org
index 0dc13e2..79d063a 100644
--- a/org/cpp/dsa/arrays-hashing/0001-two-sum.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org
@@ -1,6 +1,7 @@
 * TODO 0001. Two Sum :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0001. Two Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0001. Two Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org b/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org
similarity index 67%
rename from org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org
rename to org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org
index 895b7cd..3a5c87a 100644
--- a/org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org
@@ -1,6 +1,7 @@
 * TODO 0036. Valid Sudoku :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0036. Valid Sudoku][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0036. Valid Sudoku][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0134-gas-station.org b/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org
similarity index 76%
rename from org/cpp/dsa/greedy/0134-gas-station.org
rename to org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org
index 75c17de..853ebb8 100644
--- a/org/cpp/dsa/greedy/0134-gas-station.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org
@@ -1,6 +1,7 @@
-* TODO 0134. Gas Station :medium:
+* TODO 0049. Group Anagrams :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0134. Gas Station][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0049. Group Anagrams][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org b/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
similarity index 65%
rename from org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
rename to org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
index 15075b8..74f652f 100644
--- a/org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
@@ -1,6 +1,7 @@
 * TODO 0128. Longest Consecutive Sequence :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org b/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org
similarity index 66%
rename from org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org
rename to org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org
index 77b8eaa..61ee03e 100644
--- a/org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org
@@ -1,6 +1,7 @@
 * TODO 0217. Contains Duplicate :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org b/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org
similarity index 65%
rename from org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org
rename to org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org
index 75d9204..1693e44 100644
--- a/org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org
@@ -1,6 +1,7 @@
 * TODO 0238. Product of Array Except Self :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0238. Product of Array Except Self][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0238. Product of Array Except Self][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0242-valid-anagram.org b/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org
similarity index 67%
rename from org/cpp/dsa/arrays-hashing/0242-valid-anagram.org
rename to org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org
index 1844fca..3021958 100644
--- a/org/cpp/dsa/arrays-hashing/0242-valid-anagram.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org
@@ -1,6 +1,7 @@
 * TODO 0242. Valid Anagram :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0242. Valid Anagram][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0242. Valid Anagram][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org b/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org
similarity index 65%
rename from org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org
rename to org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org
index 88ac9dd..b84bc23 100644
--- a/org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org
@@ -1,6 +1,7 @@
 * TODO 0271. Encode and Decode Strings :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org b/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org
similarity index 66%
rename from org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org
rename to org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org
index e2ea0c9..94fdddc 100644
--- a/org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org
+++ b/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org
@@ -1,6 +1,7 @@
 * TODO 0347. Top K Frequent Elements :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org b/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org
similarity index 65%
rename from org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org
rename to org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org
index bc08a9f..a2a4896 100644
--- a/org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org
+++ b/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org
@@ -1,6 +1,7 @@
 * TODO 1408. String Matching in an Array :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1408. String Matching in an Array][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1408. String Matching in an Array][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org b/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
similarity index 63%
rename from org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
rename to org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
index f9585a8..31ea204 100644
--- a/org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
+++ b/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
@@ -1,6 +1,7 @@
 * TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org b/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org
similarity index 65%
rename from org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org
rename to org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org
index 8f2b979..81ce4f2 100644
--- a/org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org
+++ b/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org
@@ -1,6 +1,7 @@
 * TODO 2678. Number of Senior Citizens :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org b/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
similarity index 64%
rename from org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
rename to org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
index 88c8a52..71136d3 100644
--- a/org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
+++ b/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
@@ -1,6 +1,7 @@
 * TODO 0017. Letter Combinations of a Phone Number :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0022-generate-parentheses.org b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org
similarity index 66%
rename from org/cpp/dsa/backtracking/0022-generate-parentheses.org
rename to org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org
index e8f3c37..85f0315 100644
--- a/org/cpp/dsa/backtracking/0022-generate-parentheses.org
+++ b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org
@@ -1,6 +1,7 @@
 * TODO 0022. Generate Parentheses :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0022. Generate Parentheses][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0022. Generate Parentheses][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0039-combination-sum.org b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0039-combination-sum.org
rename to org/study_deck_02/dsa/backtracking/0039-combination-sum.org
index be80a15..872df61 100644
--- a/org/cpp/dsa/backtracking/0039-combination-sum.org
+++ b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org
@@ -1,6 +1,7 @@
 * TODO 0039. Combination Sum :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0039. Combination Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0039. Combination Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0040-combination-sum-ii.org b/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org
similarity index 66%
rename from org/cpp/dsa/backtracking/0040-combination-sum-ii.org
rename to org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org
index cd8d29e..3e43ba9 100644
--- a/org/cpp/dsa/backtracking/0040-combination-sum-ii.org
+++ b/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org
@@ -1,6 +1,7 @@
 * TODO 0040. Combination Sum II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0040. Combination Sum II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0040. Combination Sum II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0046-permutations.org b/org/study_deck_02/dsa/backtracking/0046-permutations.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0046-permutations.org
rename to org/study_deck_02/dsa/backtracking/0046-permutations.org
index 5cb6b23..bade254 100644
--- a/org/cpp/dsa/backtracking/0046-permutations.org
+++ b/org/study_deck_02/dsa/backtracking/0046-permutations.org
@@ -1,6 +1,7 @@
 * TODO 0046. Permutations :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0046. Permutations][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0046. Permutations][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0051-n-queens.org b/org/study_deck_02/dsa/backtracking/0051-n-queens.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0051-n-queens.org
rename to org/study_deck_02/dsa/backtracking/0051-n-queens.org
index 13f2c56..920efde 100644
--- a/org/cpp/dsa/backtracking/0051-n-queens.org
+++ b/org/study_deck_02/dsa/backtracking/0051-n-queens.org
@@ -1,6 +1,7 @@
 * TODO 0051. N Queens :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0051. N Queens][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0051. N Queens][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0052-n-queens-ii.org b/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0052-n-queens-ii.org
rename to org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org
index fe66d8a..2a78bdc 100644
--- a/org/cpp/dsa/backtracking/0052-n-queens-ii.org
+++ b/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org
@@ -1,6 +1,7 @@
 * TODO 0052. N Queens II :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0052. N Queens II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0052. N Queens II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0077-combinations.org b/org/study_deck_02/dsa/backtracking/0077-combinations.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0077-combinations.org
rename to org/study_deck_02/dsa/backtracking/0077-combinations.org
index 20e2dd9..194fd6f 100644
--- a/org/cpp/dsa/backtracking/0077-combinations.org
+++ b/org/study_deck_02/dsa/backtracking/0077-combinations.org
@@ -1,6 +1,7 @@
 * TODO 0077. Combinations :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0077. Combinations][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0077. Combinations][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0078-subsets.org b/org/study_deck_02/dsa/backtracking/0078-subsets.org
similarity index 68%
rename from org/cpp/dsa/backtracking/0078-subsets.org
rename to org/study_deck_02/dsa/backtracking/0078-subsets.org
index 9c3050d..6d136f1 100644
--- a/org/cpp/dsa/backtracking/0078-subsets.org
+++ b/org/study_deck_02/dsa/backtracking/0078-subsets.org
@@ -1,6 +1,7 @@
 * TODO 0078. Subsets :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0078. Subsets][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0078. Subsets][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0079-word-search.org b/org/study_deck_02/dsa/backtracking/0079-word-search.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0079-word-search.org
rename to org/study_deck_02/dsa/backtracking/0079-word-search.org
index 63ffdf9..e96ed65 100644
--- a/org/cpp/dsa/backtracking/0079-word-search.org
+++ b/org/study_deck_02/dsa/backtracking/0079-word-search.org
@@ -1,6 +1,7 @@
 * TODO 0079. Word Search :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0079. Word Search][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0079. Word Search][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0090-subsets-ii.org b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org
similarity index 67%
rename from org/cpp/dsa/backtracking/0090-subsets-ii.org
rename to org/study_deck_02/dsa/backtracking/0090-subsets-ii.org
index a82df28..9cb8eda 100644
--- a/org/cpp/dsa/backtracking/0090-subsets-ii.org
+++ b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org
@@ -1,6 +1,7 @@
 * TODO 0090. Subsets II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0090. Subsets II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0090. Subsets II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0131-palindrome-partitioning.org b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org
similarity index 66%
rename from org/cpp/dsa/backtracking/0131-palindrome-partitioning.org
rename to org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org
index 2e12aab..07dc0eb 100644
--- a/org/cpp/dsa/backtracking/0131-palindrome-partitioning.org
+++ b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org
@@ -1,6 +1,7 @@
 * TODO 0131. Palindrome Partitioning :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/0351-android-unlock-patterns.org b/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org
similarity index 66%
rename from org/cpp/dsa/backtracking/0351-android-unlock-patterns.org
rename to org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org
index 3c99e20..a4017bc 100644
--- a/org/cpp/dsa/backtracking/0351-android-unlock-patterns.org
+++ b/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org
@@ -1,6 +1,7 @@
 * TODO 0351. Android Unlock Patterns :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org b/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org
similarity index 65%
rename from org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org
rename to org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org
index e156300..c6ca858 100644
--- a/org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org
+++ b/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org
@@ -1,6 +1,7 @@
 * TODO 1079. Letter Tile Possibilities :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org b/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
similarity index 65%
rename from org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
rename to org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
index 62619cb..3bf2edf 100644
--- a/org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
+++ b/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
@@ -1,6 +1,7 @@
 * TODO 1863. Sum of All Subsets XOR Total :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org b/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org
similarity index 65%
rename from org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org
rename to org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org
index 506a254..64c1a9d 100644
--- a/org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org
+++ b/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org
@@ -1,6 +1,7 @@
 * TODO 0004. Median of Two Sorted Arrays :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org b/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org
similarity index 65%
rename from org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org
rename to org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org
index a40e62b..8d0d74b 100644
--- a/org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org
+++ b/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org
@@ -1,6 +1,7 @@
 * TODO 0033. Search In Rotated Sorted Array :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org b/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org
similarity index 66%
rename from org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org
rename to org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org
index c790b87..bc36ec1 100644
--- a/org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org
+++ b/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org
@@ -1,6 +1,7 @@
 * TODO 0074. Search a 2D Matrix :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org b/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
similarity index 64%
rename from org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
rename to org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
index 9ae3cae..dd80d30 100644
--- a/org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
+++ b/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
@@ -1,6 +1,7 @@
 * TODO 0153. Find Minimum In Rotated Sorted Array :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0704-binary-search.org b/org/study_deck_02/dsa/binary-search/0704-binary-search.org
similarity index 67%
rename from org/cpp/dsa/binary-search/0704-binary-search.org
rename to org/study_deck_02/dsa/binary-search/0704-binary-search.org
index df28a5b..37c1553 100644
--- a/org/cpp/dsa/binary-search/0704-binary-search.org
+++ b/org/study_deck_02/dsa/binary-search/0704-binary-search.org
@@ -1,6 +1,7 @@
 * TODO 0704. Binary Search :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0704. Binary Search][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0704. Binary Search][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org b/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
similarity index 64%
rename from org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
rename to org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
index 264b759..6841764 100644
--- a/org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
+++ b/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
@@ -1,6 +1,7 @@
 * TODO 0719. Find K-th Smallest Pair Distance :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0875-koko-eating-bananas.org b/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org
similarity index 66%
rename from org/cpp/dsa/binary-search/0875-koko-eating-bananas.org
rename to org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org
index dc32e83..365a14a 100644
--- a/org/cpp/dsa/binary-search/0875-koko-eating-bananas.org
+++ b/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org
@@ -1,6 +1,7 @@
 * TODO 0875. Koko Eating Bananas :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/0981-time-based-key-value-store.org b/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org
similarity index 65%
rename from org/cpp/dsa/binary-search/0981-time-based-key-value-store.org
rename to org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org
index 8e1cc1b..014cdae 100644
--- a/org/cpp/dsa/binary-search/0981-time-based-key-value-store.org
+++ b/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org
@@ -1,6 +1,7 @@
 * TODO 0981. Time Based Key Value Store :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org b/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
similarity index 64%
rename from org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
rename to org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
index 7f06623..a30db60 100644
--- a/org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
+++ b/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
@@ -1,6 +1,7 @@
 * TODO 2300. Successful Pairs of Spells and Potions :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0007-reverse-integer.org b/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org
similarity index 67%
rename from org/cpp/dsa/bit-manipulation/0007-reverse-integer.org
rename to org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org
index a9b3482..48e0bf8 100644
--- a/org/cpp/dsa/bit-manipulation/0007-reverse-integer.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org
@@ -1,6 +1,7 @@
 * TODO 0007. Reverse Integer :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0007. Reverse Integer][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0007. Reverse Integer][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0136-single-number.org b/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org
similarity index 67%
rename from org/cpp/dsa/bit-manipulation/0136-single-number.org
rename to org/study_deck_02/dsa/bit-manipulation/0136-single-number.org
index 08d6de1..23bc5c6 100644
--- a/org/cpp/dsa/bit-manipulation/0136-single-number.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org
@@ -1,6 +1,7 @@
 * TODO 0136. Single Number :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0136. Single Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0136. Single Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0190-reverse-bits.org b/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org
similarity index 67%
rename from org/cpp/dsa/bit-manipulation/0190-reverse-bits.org
rename to org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org
index 8d7c15a..7f4dd8f 100644
--- a/org/cpp/dsa/bit-manipulation/0190-reverse-bits.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org
@@ -1,6 +1,7 @@
 * TODO 0190. Reverse Bits :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0190. Reverse Bits][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0190. Reverse Bits][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org b/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org
similarity index 66%
rename from org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org
rename to org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org
index c58bcfc..7dee623 100644
--- a/org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org
@@ -1,6 +1,7 @@
 * TODO 0191. Number of 1 Bits :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0191. Number of 1 Bits][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0191. Number of 1 Bits][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0231-power-of-two.org b/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org
similarity index 67%
rename from org/cpp/dsa/bit-manipulation/0231-power-of-two.org
rename to org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org
index 0fc6e0c..339a02b 100644
--- a/org/cpp/dsa/bit-manipulation/0231-power-of-two.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org
@@ -1,6 +1,7 @@
 * TODO 0231. Power of Two :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0231. Power of Two][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0231. Power of Two][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0260-single-number-iii.org b/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org
similarity index 66%
rename from org/cpp/dsa/bit-manipulation/0260-single-number-iii.org
rename to org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org
index 0e9e0b9..089bd0d 100644
--- a/org/cpp/dsa/bit-manipulation/0260-single-number-iii.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org
@@ -1,6 +1,7 @@
 * TODO 0260. Single Number III :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0260. Single Number III][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0260. Single Number III][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org b/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org
new file mode 100644
index 0000000..a76fedf
--- /dev/null
+++ b/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org
@@ -0,0 +1,18 @@
+* TODO 0268. Missing Number :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0268. Missing Number][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
diff --git a/org/cpp/dsa/bit-manipulation/0338-counting-bits.org b/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org
similarity index 67%
rename from org/cpp/dsa/bit-manipulation/0338-counting-bits.org
rename to org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org
index d7fe7e6..7cf3c7c 100644
--- a/org/cpp/dsa/bit-manipulation/0338-counting-bits.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org
@@ -1,6 +1,7 @@
 * TODO 0338. Counting Bits :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0338. Counting Bits][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0338. Counting Bits][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org b/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org
similarity index 66%
rename from org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org
rename to org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org
index c638d42..262e103 100644
--- a/org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org
+++ b/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org
@@ -1,6 +1,7 @@
 * TODO 0371. Sum of Two Integers :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0371. Sum of Two Integers][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0371. Sum of Two Integers][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org b/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
similarity index 64%
rename from org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
rename to org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
index e4b38e3..6275894 100644
--- a/org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
+++ b/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
@@ -1,6 +1,7 @@
 * TODO 2220. Minimum Bit Flips to Convert Number :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0127-word-ladder.org b/org/study_deck_02/dsa/graphs/0127-word-ladder.org
similarity index 67%
rename from org/cpp/dsa/graphs/0127-word-ladder.org
rename to org/study_deck_02/dsa/graphs/0127-word-ladder.org
index 6a0ac67..62c31a6 100644
--- a/org/cpp/dsa/graphs/0127-word-ladder.org
+++ b/org/study_deck_02/dsa/graphs/0127-word-ladder.org
@@ -1,6 +1,7 @@
 * TODO 0127. Word Ladder :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0127. Word Ladder][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0127. Word Ladder][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0130-surrounded-regions.org b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org
similarity index 66%
rename from org/cpp/dsa/graphs/0130-surrounded-regions.org
rename to org/study_deck_02/dsa/graphs/0130-surrounded-regions.org
index b036229..e385e06 100644
--- a/org/cpp/dsa/graphs/0130-surrounded-regions.org
+++ b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org
@@ -1,6 +1,7 @@
 * TODO 0130. Surrounded Regions :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0130. Surrounded Regions][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0130. Surrounded Regions][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0133-clone-graph.org b/org/study_deck_02/dsa/graphs/0133-clone-graph.org
similarity index 67%
rename from org/cpp/dsa/graphs/0133-clone-graph.org
rename to org/study_deck_02/dsa/graphs/0133-clone-graph.org
index 785bfc6..210f4a2 100644
--- a/org/cpp/dsa/graphs/0133-clone-graph.org
+++ b/org/study_deck_02/dsa/graphs/0133-clone-graph.org
@@ -1,6 +1,7 @@
 * TODO 0133. Clone Graph :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0133. Clone Graph][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0133. Clone Graph][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0200-number-of-islands.org b/org/study_deck_02/dsa/graphs/0200-number-of-islands.org
similarity index 66%
rename from org/cpp/dsa/graphs/0200-number-of-islands.org
rename to org/study_deck_02/dsa/graphs/0200-number-of-islands.org
index 71d1212..d0faeef 100644
--- a/org/cpp/dsa/graphs/0200-number-of-islands.org
+++ b/org/study_deck_02/dsa/graphs/0200-number-of-islands.org
@@ -1,6 +1,7 @@
 * TODO 0200. Number of Islands :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0200. Number of Islands][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0200. Number of Islands][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0207-course-schedule.org b/org/study_deck_02/dsa/graphs/0207-course-schedule.org
similarity index 67%
rename from org/cpp/dsa/graphs/0207-course-schedule.org
rename to org/study_deck_02/dsa/graphs/0207-course-schedule.org
index 3b7d601..9c87f3e 100644
--- a/org/cpp/dsa/graphs/0207-course-schedule.org
+++ b/org/study_deck_02/dsa/graphs/0207-course-schedule.org
@@ -1,6 +1,7 @@
 * TODO 0207. Course Schedule :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0207. Course Schedule][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0207. Course Schedule][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0210-course-schedule-ii.org b/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org
similarity index 66%
rename from org/cpp/dsa/graphs/0210-course-schedule-ii.org
rename to org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org
index f5e5794..478e733 100644
--- a/org/cpp/dsa/graphs/0210-course-schedule-ii.org
+++ b/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org
@@ -1,6 +1,7 @@
 * TODO 0210. Course Schedule II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0210. Course Schedule II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0210. Course Schedule II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0261-graph-valid-tree.org b/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org
similarity index 66%
rename from org/cpp/dsa/graphs/0261-graph-valid-tree.org
rename to org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org
index 46a6468..2704048 100644
--- a/org/cpp/dsa/graphs/0261-graph-valid-tree.org
+++ b/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org
@@ -1,6 +1,7 @@
 * TODO 0261. Graph Valid Tree :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0261. Graph Valid Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0261. Graph Valid Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0286-walls-and-gates.org b/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org
similarity index 67%
rename from org/cpp/dsa/graphs/0286-walls-and-gates.org
rename to org/study_deck_02/dsa/graphs/0286-walls-and-gates.org
index b8a9093..92bc80d 100644
--- a/org/cpp/dsa/graphs/0286-walls-and-gates.org
+++ b/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org
@@ -1,6 +1,7 @@
 * TODO 0286. Walls And Gates :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0286. Walls And Gates][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0286. Walls And Gates][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org b/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
similarity index 63%
rename from org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
rename to org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
index 1dfb23b..5c6d6c4 100644
--- a/org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
+++ b/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
@@ -1,6 +1,7 @@
 * TODO 0323. Number of Connected Components In An Undirected Graph :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org b/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org
similarity index 65%
rename from org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org
rename to org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org
index ff7196b..ba05b8e 100644
--- a/org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org
+++ b/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org
@@ -1,6 +1,7 @@
 * TODO 0417. Pacific Atlantic Water Flow :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0684-redundant-connection.org b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org
similarity index 66%
rename from org/cpp/dsa/graphs/0684-redundant-connection.org
rename to org/study_deck_02/dsa/graphs/0684-redundant-connection.org
index ffd4ba4..3123c03 100644
--- a/org/cpp/dsa/graphs/0684-redundant-connection.org
+++ b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org
@@ -1,6 +1,7 @@
 * TODO 0684. Redundant Connection :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0684. Redundant Connection][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0684. Redundant Connection][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0695-max-area-of-island.org b/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org
similarity index 66%
rename from org/cpp/dsa/graphs/0695-max-area-of-island.org
rename to org/study_deck_02/dsa/graphs/0695-max-area-of-island.org
index 3a6257a..857af30 100644
--- a/org/cpp/dsa/graphs/0695-max-area-of-island.org
+++ b/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org
@@ -1,6 +1,7 @@
 * TODO 0695. Max Area of Island :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0695. Max Area of Island][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0695. Max Area of Island][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0802-find-eventual-safe-states.org b/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org
similarity index 65%
rename from org/cpp/dsa/graphs/0802-find-eventual-safe-states.org
rename to org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org
index bfa516b..08100ac 100644
--- a/org/cpp/dsa/graphs/0802-find-eventual-safe-states.org
+++ b/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org
@@ -1,6 +1,7 @@
 * TODO 0802. Find Eventual Safe States :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0802. Find Eventual Safe States][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/0994-rotting-oranges.org b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org
similarity index 67%
rename from org/cpp/dsa/graphs/0994-rotting-oranges.org
rename to org/study_deck_02/dsa/graphs/0994-rotting-oranges.org
index 2b55d15..f6ad004 100644
--- a/org/cpp/dsa/graphs/0994-rotting-oranges.org
+++ b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org
@@ -1,6 +1,7 @@
 * TODO 0994. Rotting Oranges :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0994. Rotting Oranges][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0994. Rotting Oranges][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/1905-count-sub-islands.org b/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org
similarity index 66%
rename from org/cpp/dsa/graphs/1905-count-sub-islands.org
rename to org/study_deck_02/dsa/graphs/1905-count-sub-islands.org
index 2165983..80bc452 100644
--- a/org/cpp/dsa/graphs/1905-count-sub-islands.org
+++ b/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org
@@ -1,6 +1,7 @@
 * TODO 1905. Count Sub Islands :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1905. Count Sub Islands][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1905. Count Sub Islands][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/2092-find-all-people-with-secret.org b/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org
similarity index 65%
rename from org/cpp/dsa/graphs/2092-find-all-people-with-secret.org
rename to org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org
index feb1ef8..2b38c79 100644
--- a/org/cpp/dsa/graphs/2092-find-all-people-with-secret.org
+++ b/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org
@@ -1,6 +1,7 @@
 * TODO 2092. Find All People With Secret :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2092. Find All People With Secret][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2092. Find All People With Secret][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org b/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
similarity index 65%
rename from org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
rename to org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
index d0652dd..a0b3e8b 100644
--- a/org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
+++ b/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
@@ -1,6 +1,7 @@
 * TODO 2658. Maximum Number of Fish in a Grid :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/graphs/2924-find-champion-ii.org b/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org
similarity index 66%
rename from org/cpp/dsa/graphs/2924-find-champion-ii.org
rename to org/study_deck_02/dsa/graphs/2924-find-champion-ii.org
index 84da789..35cc1f4 100644
--- a/org/cpp/dsa/graphs/2924-find-champion-ii.org
+++ b/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org
@@ -1,6 +1,7 @@
 * TODO 2924. Find Champion II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2924. Find Champion II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2924. Find Champion II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0045-jump-game-ii.org b/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org
similarity index 67%
rename from org/cpp/dsa/greedy/0045-jump-game-ii.org
rename to org/study_deck_02/dsa/greedy/0045-jump-game-ii.org
index f0c8af9..d79755e 100644
--- a/org/cpp/dsa/greedy/0045-jump-game-ii.org
+++ b/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org
@@ -1,6 +1,7 @@
 * TODO 0045. Jump Game II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0045. Jump Game II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0045. Jump Game II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0053-maximum-subarray.org b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org
similarity index 66%
rename from org/cpp/dsa/greedy/0053-maximum-subarray.org
rename to org/study_deck_02/dsa/greedy/0053-maximum-subarray.org
index 6dab6e9..47e868f 100644
--- a/org/cpp/dsa/greedy/0053-maximum-subarray.org
+++ b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org
@@ -1,6 +1,7 @@
 * TODO 0053. Maximum Subarray :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0053. Maximum Subarray][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0053. Maximum Subarray][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0055-jump-game.org b/org/study_deck_02/dsa/greedy/0055-jump-game.org
similarity index 67%
rename from org/cpp/dsa/greedy/0055-jump-game.org
rename to org/study_deck_02/dsa/greedy/0055-jump-game.org
index a209e58..4ee97c3 100644
--- a/org/cpp/dsa/greedy/0055-jump-game.org
+++ b/org/study_deck_02/dsa/greedy/0055-jump-game.org
@@ -1,6 +1,7 @@
 * TODO 0055. Jump Game :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0055. Jump Game][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0055. Jump Game][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/study_deck_02/dsa/greedy/0134-gas-station.org b/org/study_deck_02/dsa/greedy/0134-gas-station.org
new file mode 100644
index 0000000..5d2ca8e
--- /dev/null
+++ b/org/study_deck_02/dsa/greedy/0134-gas-station.org
@@ -0,0 +1,18 @@
+* TODO 0134. Gas Station :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0134. Gas Station][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
diff --git a/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org b/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org
similarity index 65%
rename from org/cpp/dsa/greedy/0678-valid-parenthesis-string.org
rename to org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org
index 07b48a9..716b357 100644
--- a/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org
+++ b/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org
@@ -1,6 +1,7 @@
 * TODO 0678. Valid Parenthesis String :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0678. Valid Parenthesis String][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0678. Valid Parenthesis String][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0763-partition-labels.org b/org/study_deck_02/dsa/greedy/0763-partition-labels.org
similarity index 66%
rename from org/cpp/dsa/greedy/0763-partition-labels.org
rename to org/study_deck_02/dsa/greedy/0763-partition-labels.org
index e78a208..0645a71 100644
--- a/org/cpp/dsa/greedy/0763-partition-labels.org
+++ b/org/study_deck_02/dsa/greedy/0763-partition-labels.org
@@ -1,6 +1,7 @@
 * TODO 0763. Partition Labels :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0763. Partition Labels][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0763. Partition Labels][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0846-hand-of-straights.org b/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org
similarity index 66%
rename from org/cpp/dsa/greedy/0846-hand-of-straights.org
rename to org/study_deck_02/dsa/greedy/0846-hand-of-straights.org
index e2b9283..8366411 100644
--- a/org/cpp/dsa/greedy/0846-hand-of-straights.org
+++ b/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org
@@ -1,6 +1,7 @@
 * TODO 0846. Hand of Straights :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0846. Hand of Straights][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0846. Hand of Straights][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org b/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
similarity index 64%
rename from org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
rename to org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
index d8ecb44..44a803f 100644
--- a/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
+++ b/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
@@ -1,6 +1,7 @@
 * TODO 0945. Minimum Increment to Make Array Unique :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org b/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org
similarity index 65%
rename from org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org
rename to org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org
index 947be2b..b1d3cee 100644
--- a/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org
+++ b/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org
@@ -1,6 +1,7 @@
 * TODO 0978. Longest Turbulent Subarray :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/1871-jump-game-vii.org b/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org
similarity index 67%
rename from org/cpp/dsa/greedy/1871-jump-game-vii.org
rename to org/study_deck_02/dsa/greedy/1871-jump-game-vii.org
index 1bfbc6d..ba407a2 100644
--- a/org/cpp/dsa/greedy/1871-jump-game-vii.org
+++ b/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org
@@ -1,6 +1,7 @@
 * TODO 1871. Jump Game VII :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1871. Jump Game VII][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1871. Jump Game VII][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org b/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
similarity index 64%
rename from org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
rename to org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
index b951c5d..dbd5ba1 100644
--- a/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
+++ b/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
@@ -1,6 +1,7 @@
 * TODO 1899. Merge Triplets to Form Target Triplet :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org b/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
similarity index 65%
rename from org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
rename to org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
index d4e01be..05e4e65 100644
--- a/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
@@ -1,6 +1,7 @@
 * TODO 0215. Kth Largest Element In An Array :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0215. Kth Largest Element In An Array][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0215. Kth Largest Element In An Array][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org b/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
similarity index 65%
rename from org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
rename to org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
index db809b0..d3cb709 100644
--- a/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
@@ -1,6 +1,7 @@
 * TODO 0295. Find Median From Data Stream :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0295. Find Median From Data Stream][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0295. Find Median From Data Stream][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org b/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org
similarity index 67%
rename from org/cpp/dsa/heap-priority-queue/0355-design-twitter.org
rename to org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org
index 777a9d5..bc464fe 100644
--- a/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org
@@ -1,6 +1,7 @@
 * TODO 0355. Design Twitter :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0355. Design Twitter][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0355. Design Twitter][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org b/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org
similarity index 67%
rename from org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org
rename to org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org
index 8c1646d..9958cfe 100644
--- a/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org
@@ -1,6 +1,7 @@
 * TODO 0621. Task Scheduler :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0621. Task Scheduler][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0621. Task Scheduler][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org b/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
similarity index 65%
rename from org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
rename to org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
index 9484df2..58b39e1 100644
--- a/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
@@ -1,6 +1,7 @@
 * TODO 0703. Kth Largest Element In a Stream :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org b/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
similarity index 65%
rename from org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
rename to org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
index 762b88d..52f35ca 100644
--- a/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
@@ -1,6 +1,7 @@
 * TODO 0973. K Closest Points to Origin :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0973. K Closest Points to Origin][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0973. K Closest Points to Origin][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org b/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org
similarity index 66%
rename from org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org
rename to org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org
index b522aca..835390d 100644
--- a/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org
+++ b/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org
@@ -1,6 +1,7 @@
 * TODO 1046. Last Stone Weight :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1046. Last Stone Weight][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1046. Last Stone Weight][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0056-merge-intervals.org b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org
similarity index 67%
rename from org/cpp/dsa/intervals/0056-merge-intervals.org
rename to org/study_deck_02/dsa/intervals/0056-merge-intervals.org
index bd2cf32..2b5615e 100644
--- a/org/cpp/dsa/intervals/0056-merge-intervals.org
+++ b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org
@@ -1,6 +1,7 @@
 * TODO 0056. Merge Intervals :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0056. Merge Intervals][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0056. Merge Intervals][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0057-insert-interval.org b/org/study_deck_02/dsa/intervals/0057-insert-interval.org
similarity index 67%
rename from org/cpp/dsa/intervals/0057-insert-interval.org
rename to org/study_deck_02/dsa/intervals/0057-insert-interval.org
index dea85a2..3317f99 100644
--- a/org/cpp/dsa/intervals/0057-insert-interval.org
+++ b/org/study_deck_02/dsa/intervals/0057-insert-interval.org
@@ -1,6 +1,7 @@
 * TODO 0057. Insert Interval :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0057. Insert Interval][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0057. Insert Interval][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0252-meeting-rooms.org b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org
similarity index 67%
rename from org/cpp/dsa/intervals/0252-meeting-rooms.org
rename to org/study_deck_02/dsa/intervals/0252-meeting-rooms.org
index 182a5f7..be5eef3 100644
--- a/org/cpp/dsa/intervals/0252-meeting-rooms.org
+++ b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org
@@ -1,6 +1,7 @@
 * TODO 0252. Meeting Rooms :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0252. Meeting Rooms][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0252. Meeting Rooms][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org b/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org
similarity index 66%
rename from org/cpp/dsa/intervals/0253-meeting-rooms-ii.org
rename to org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org
index 99728db..edaf4c1 100644
--- a/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org
+++ b/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org
@@ -1,6 +1,7 @@
 * TODO 0253. Meeting Rooms II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0253. Meeting Rooms II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0253. Meeting Rooms II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org b/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org
similarity index 65%
rename from org/cpp/dsa/intervals/0435-non-overlapping-intervals.org
rename to org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org
index 1eece6a..b46f2ae 100644
--- a/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org
+++ b/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org
@@ -1,6 +1,7 @@
 * TODO 0435. Non Overlapping Intervals :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0435. Non Overlapping Intervals][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0435. Non Overlapping Intervals][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/0986-interval-list-intersections.org b/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org
similarity index 65%
rename from org/cpp/dsa/intervals/0986-interval-list-intersections.org
rename to org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org
index 68b2386..d36d21a 100644
--- a/org/cpp/dsa/intervals/0986-interval-list-intersections.org
+++ b/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org
@@ -1,6 +1,7 @@
 * TODO 0986. Interval List Intersections :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0986. Interval List Intersections][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0986. Interval List Intersections][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org b/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org
similarity index 64%
rename from org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org
rename to org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org
index 4f00042..f04b222 100644
--- a/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org
+++ b/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org
@@ -1,6 +1,7 @@
 * TODO 1851. Minimum Interval to Include Each Query :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0002-add-two-numbers.org b/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org
similarity index 67%
rename from org/cpp/dsa/linked-list/0002-add-two-numbers.org
rename to org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org
index 2a466aa..64dee49 100644
--- a/org/cpp/dsa/linked-list/0002-add-two-numbers.org
+++ b/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org
@@ -1,6 +1,7 @@
 * TODO 0002. Add Two Numbers :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0002. Add Two Numbers][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0002. Add Two Numbers][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org b/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
similarity index 65%
rename from org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
rename to org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
index a94d1fa..1ac10a3 100644
--- a/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
+++ b/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
@@ -1,6 +1,7 @@
 * TODO 0019. Remove Nth Node From End of List :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org b/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org
similarity index 65%
rename from org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org
rename to org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org
index 0825bde..66ec829 100644
--- a/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org
+++ b/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org
@@ -1,6 +1,7 @@
 * TODO 0021. Merge Two Sorted Lists :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org b/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org
similarity index 66%
rename from org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org
rename to org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org
index 6197b45..8bd30e0 100644
--- a/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org
+++ b/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org
@@ -1,6 +1,7 @@
 * TODO 0023. Merge K Sorted Lists :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0023. Merge K Sorted Lists][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0023. Merge K Sorted Lists][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org b/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org
similarity index 65%
rename from org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org
rename to org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org
index d7d13da..ba7259d 100644
--- a/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org
+++ b/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org
@@ -1,6 +1,7 @@
 * TODO 0025. Reverse Nodes In K Group :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/bit-manipulation/0268-missing-number.org b/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org
similarity index 69%
rename from org/cpp/dsa/bit-manipulation/0268-missing-number.org
rename to org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org
index df3f956..109a8f4 100644
--- a/org/cpp/dsa/bit-manipulation/0268-missing-number.org
+++ b/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org
@@ -1,6 +1,7 @@
-* TODO 0268. Missing Number :easy:
+* TODO 0138. Copy List With Random Pointer :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0268. Missing Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0138. Copy List With Random Pointer][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0141-linked-list-cycle.org b/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org
similarity index 66%
rename from org/cpp/dsa/linked-list/0141-linked-list-cycle.org
rename to org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org
index f30f655..18ca4a6 100644
--- a/org/cpp/dsa/linked-list/0141-linked-list-cycle.org
+++ b/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org
@@ -1,6 +1,7 @@
 * TODO 0141. Linked List Cycle :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0141. Linked List Cycle][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0141. Linked List Cycle][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0143-reorder-list.org b/org/study_deck_02/dsa/linked-list/0143-reorder-list.org
similarity index 67%
rename from org/cpp/dsa/linked-list/0143-reorder-list.org
rename to org/study_deck_02/dsa/linked-list/0143-reorder-list.org
index 4a60ef6..94760cf 100644
--- a/org/cpp/dsa/linked-list/0143-reorder-list.org
+++ b/org/study_deck_02/dsa/linked-list/0143-reorder-list.org
@@ -1,6 +1,7 @@
 * TODO 0143. Reorder List :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0143. Reorder List][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0143. Reorder List][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0146-lru-cache.org b/org/study_deck_02/dsa/linked-list/0146-lru-cache.org
similarity index 67%
rename from org/cpp/dsa/linked-list/0146-lru-cache.org
rename to org/study_deck_02/dsa/linked-list/0146-lru-cache.org
index b055fe3..a4d1c41 100644
--- a/org/cpp/dsa/linked-list/0146-lru-cache.org
+++ b/org/study_deck_02/dsa/linked-list/0146-lru-cache.org
@@ -1,6 +1,7 @@
 * TODO 0146. LRU Cache :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0146. LRU Cache][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0146. LRU Cache][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0206-reverse-linked-list.org b/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org
similarity index 66%
rename from org/cpp/dsa/linked-list/0206-reverse-linked-list.org
rename to org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org
index 808a4dd..d1cc57d 100644
--- a/org/cpp/dsa/linked-list/0206-reverse-linked-list.org
+++ b/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org
@@ -1,6 +1,7 @@
 * TODO 0206. Reverse Linked List :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0206. Reverse Linked List][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0206. Reverse Linked List][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org b/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org
similarity index 65%
rename from org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org
rename to org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org
index e2b327b..405ab62 100644
--- a/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org
+++ b/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org
@@ -1,6 +1,7 @@
 * TODO 0287. Find The Duplicate Number :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0287. Find The Duplicate Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0287. Find The Duplicate Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org b/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org
similarity index 65%
rename from org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org
rename to org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org
index 37ab070..ad42f10 100644
--- a/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org
+++ b/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org
@@ -1,6 +1,7 @@
 * TODO 0725. Split Linked List in Parts :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0725. Split Linked List in Parts][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0725. Split Linked List in Parts][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/1472-design-browser-history.org b/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org
similarity index 66%
rename from org/cpp/dsa/linked-list/1472-design-browser-history.org
rename to org/study_deck_02/dsa/linked-list/1472-design-browser-history.org
index c470404..135f1f2 100644
--- a/org/cpp/dsa/linked-list/1472-design-browser-history.org
+++ b/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org
@@ -1,6 +1,7 @@
 * TODO 1472. Design Browser History :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1472. Design Browser History][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1472. Design Browser History][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org b/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
similarity index 65%
rename from org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
rename to org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
index e2c92a8..624cb14 100644
--- a/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
+++ b/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
@@ -1,6 +1,7 @@
 * TODO 1721. Swapping Nodes in a Linked List :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org b/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org
similarity index 65%
rename from org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org
rename to org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org
index 94fae98..0fe08e6 100644
--- a/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org
+++ b/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org
@@ -1,6 +1,7 @@
 * TODO 2487. Remove Nodes From Linked List :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0009-palindrome-number.org b/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0009-palindrome-number.org
rename to org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org
index d6c9f54..259ec79 100644
--- a/org/cpp/dsa/math-geometry/0009-palindrome-number.org
+++ b/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org
@@ -1,6 +1,7 @@
 * TODO 0009. Palindrome Number :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0009. Palindrome Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0009. Palindrome Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0012-integer-to-roman.org b/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0012-integer-to-roman.org
rename to org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org
index e846dbf..2fbf233 100644
--- a/org/cpp/dsa/math-geometry/0012-integer-to-roman.org
+++ b/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org
@@ -1,6 +1,7 @@
 * TODO 0012. Integer to Roman :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0012. Integer to Roman][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0012. Integer to Roman][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0043-multiply-strings.org b/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0043-multiply-strings.org
rename to org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org
index cf41df3..b878b30 100644
--- a/org/cpp/dsa/math-geometry/0043-multiply-strings.org
+++ b/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org
@@ -1,6 +1,7 @@
 * TODO 0043. Multiply Strings :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0043. Multiply Strings][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0043. Multiply Strings][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0048-rotate-image.org b/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/0048-rotate-image.org
rename to org/study_deck_02/dsa/math-geometry/0048-rotate-image.org
index 571630a..4678b7f 100644
--- a/org/cpp/dsa/math-geometry/0048-rotate-image.org
+++ b/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org
@@ -1,6 +1,7 @@
 * TODO 0048. Rotate Image :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0048. Rotate Image][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0048. Rotate Image][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0050-pow-x-n.org b/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/0050-pow-x-n.org
rename to org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org
index 7e2c4cc..88ef2e1 100644
--- a/org/cpp/dsa/math-geometry/0050-pow-x-n.org
+++ b/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org
@@ -1,6 +1,7 @@
 * TODO 0050. Pow(x, n) :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0050. Pow(x, n)][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0050. Pow(x, n)][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0054-spiral-matrix.org b/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/0054-spiral-matrix.org
rename to org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org
index ac02832..691c870 100644
--- a/org/cpp/dsa/math-geometry/0054-spiral-matrix.org
+++ b/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org
@@ -1,6 +1,7 @@
 * TODO 0054. Spiral Matrix :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0054. Spiral Matrix][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0054. Spiral Matrix][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0066-plus-one.org b/org/study_deck_02/dsa/math-geometry/0066-plus-one.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/0066-plus-one.org
rename to org/study_deck_02/dsa/math-geometry/0066-plus-one.org
index 4f07184..4a84a43 100644
--- a/org/cpp/dsa/math-geometry/0066-plus-one.org
+++ b/org/study_deck_02/dsa/math-geometry/0066-plus-one.org
@@ -1,6 +1,7 @@
 * TODO 0066. Plus One :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0066. Plus One][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0066. Plus One][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org b/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org
rename to org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org
index 655b79d..ab35f89 100644
--- a/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org
+++ b/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org
@@ -1,6 +1,7 @@
 * TODO 0073. Set Matrix Zeroes :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0073. Set Matrix Zeroes][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0073. Set Matrix Zeroes][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0202-happy-number.org b/org/study_deck_02/dsa/math-geometry/0202-happy-number.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/0202-happy-number.org
rename to org/study_deck_02/dsa/math-geometry/0202-happy-number.org
index 125bcbd..db08a8b 100644
--- a/org/cpp/dsa/math-geometry/0202-happy-number.org
+++ b/org/study_deck_02/dsa/math-geometry/0202-happy-number.org
@@ -1,6 +1,7 @@
 * TODO 0202. Happy Number :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0202. Happy Number][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0202. Happy Number][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0296-best-meeting-point.org b/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0296-best-meeting-point.org
rename to org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org
index 918528b..8b40e45 100644
--- a/org/cpp/dsa/math-geometry/0296-best-meeting-point.org
+++ b/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org
@@ -1,6 +1,7 @@
 * TODO 0296. Best Meeting Point :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0296. Best Meeting Point][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0296. Best Meeting Point][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org b/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org
rename to org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org
index 2809f47..2064a36 100644
--- a/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org
+++ b/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org
@@ -1,6 +1,7 @@
 * TODO 0840. Magic Squares In Grid :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0840. Magic Squares In Grid][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0840. Magic Squares In Grid][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org b/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
similarity index 64%
rename from org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
rename to org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
index f94f4cf..d30f420 100644
--- a/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
+++ b/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
@@ -1,6 +1,7 @@
 * TODO 1780. Check if Number is a Sum of Powers of Three :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/2013-detect-squares.org b/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org
similarity index 67%
rename from org/cpp/dsa/math-geometry/2013-detect-squares.org
rename to org/study_deck_02/dsa/math-geometry/2013-detect-squares.org
index 4cf8bee..5e3d39d 100644
--- a/org/cpp/dsa/math-geometry/2013-detect-squares.org
+++ b/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org
@@ -1,6 +1,7 @@
 * TODO 2013. Detect Squares :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2013. Detect Squares][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2013. Detect Squares][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org b/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org
similarity index 66%
rename from org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org
rename to org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org
index 3800a8f..8377e67 100644
--- a/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org
+++ b/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org
@@ -1,6 +1,7 @@
 * TODO 2326. Spiral Matrix IV :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2326. Spiral Matrix IV][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2326. Spiral Matrix IV][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org b/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
similarity index 64%
rename from org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
rename to org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
index c886591..0f91ed9 100644
--- a/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
+++ b/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
@@ -1,6 +1,7 @@
 * TODO 2698. Find the Punishment Number of an Integer :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org b/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
similarity index 63%
rename from org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
rename to org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
index e5c9147..d9fff60 100644
--- a/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
+++ b/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
@@ -1,6 +1,7 @@
 * TODO 0003. Longest Substring Without Repeating Characters :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org b/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org
similarity index 65%
rename from org/cpp/dsa/sliding-window/0076-minimum-window-substring.org
rename to org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org
index e8906a4..b526ade 100644
--- a/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org
+++ b/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org
@@ -1,6 +1,7 @@
 * TODO 0076. Minimum Window Substring :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0076. Minimum Window Substring][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0076. Minimum Window Substring][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org b/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
similarity index 65%
rename from org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
rename to org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
index fc4f48c..324982f 100644
--- a/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
+++ b/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
@@ -1,6 +1,7 @@
 * TODO 0121. Best Time to Buy And Sell Stock :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org b/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org
similarity index 65%
rename from org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org
rename to org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org
index 4634c45..9f251c9 100644
--- a/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org
+++ b/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org
@@ -1,6 +1,7 @@
 * TODO 0239. Sliding Window Maximum :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0239. Sliding Window Maximum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0239. Sliding Window Maximum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org b/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org
similarity index 64%
rename from org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org
rename to org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org
index 5628c25..974cd95 100644
--- a/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org
+++ b/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org
@@ -1,6 +1,7 @@
 * TODO 0424. Longest Repeating Character Replacement :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/0567-permutation-in-string.org b/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org
similarity index 66%
rename from org/cpp/dsa/sliding-window/0567-permutation-in-string.org
rename to org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org
index 53d4051..5585afc 100644
--- a/org/cpp/dsa/sliding-window/0567-permutation-in-string.org
+++ b/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org
@@ -1,6 +1,7 @@
 * TODO 0567. Permutation In String :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0567. Permutation In String][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0567. Permutation In String][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org b/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
similarity index 62%
rename from org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
rename to org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
index 0c583fe..9247e8a 100644
--- a/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
+++ b/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
@@ -1,6 +1,7 @@
 * TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0020-valid-parentheses.org b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org
similarity index 66%
rename from org/cpp/dsa/stack/0020-valid-parentheses.org
rename to org/study_deck_02/dsa/stack/0020-valid-parentheses.org
index 2ce9cf4..a4690d2 100644
--- a/org/cpp/dsa/stack/0020-valid-parentheses.org
+++ b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org
@@ -1,6 +1,7 @@
 * TODO 0020. Valid Parentheses :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0020. Valid Parentheses][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0020. Valid Parentheses][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org b/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org
similarity index 65%
rename from org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org
rename to org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org
index e89d23b..7c6c00d 100644
--- a/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org
+++ b/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org
@@ -1,6 +1,7 @@
 * TODO 0084. Largest Rectangle In Histogram :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org b/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org
similarity index 65%
rename from org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org
rename to org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org
index bb171b5..139cc16 100644
--- a/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org
+++ b/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org
@@ -1,6 +1,7 @@
 * TODO 0150. Evaluate Reverse Polish Notation :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0155-min-stack.org b/org/study_deck_02/dsa/stack/0155-min-stack.org
similarity index 67%
rename from org/cpp/dsa/stack/0155-min-stack.org
rename to org/study_deck_02/dsa/stack/0155-min-stack.org
index 341ca08..07ab162 100644
--- a/org/cpp/dsa/stack/0155-min-stack.org
+++ b/org/study_deck_02/dsa/stack/0155-min-stack.org
@@ -1,6 +1,7 @@
 * TODO 0155. Min Stack :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0155. Min Stack][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0155. Min Stack][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0682-baseball-game.org b/org/study_deck_02/dsa/stack/0682-baseball-game.org
similarity index 67%
rename from org/cpp/dsa/stack/0682-baseball-game.org
rename to org/study_deck_02/dsa/stack/0682-baseball-game.org
index 6b38958..849dc83 100644
--- a/org/cpp/dsa/stack/0682-baseball-game.org
+++ b/org/study_deck_02/dsa/stack/0682-baseball-game.org
@@ -1,6 +1,7 @@
 * TODO 0682. Baseball Game :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0682. Baseball Game][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0682. Baseball Game][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0726-number-of-atoms.org b/org/study_deck_02/dsa/stack/0726-number-of-atoms.org
similarity index 66%
rename from org/cpp/dsa/stack/0726-number-of-atoms.org
rename to org/study_deck_02/dsa/stack/0726-number-of-atoms.org
index 5c3e099..2eb1287 100644
--- a/org/cpp/dsa/stack/0726-number-of-atoms.org
+++ b/org/study_deck_02/dsa/stack/0726-number-of-atoms.org
@@ -1,6 +1,7 @@
 * TODO 0726. Number of Atoms :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0726. Number of Atoms][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0726. Number of Atoms][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0739-daily-temperatures.org b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org
similarity index 66%
rename from org/cpp/dsa/stack/0739-daily-temperatures.org
rename to org/study_deck_02/dsa/stack/0739-daily-temperatures.org
index 7a71930..fb64f21 100644
--- a/org/cpp/dsa/stack/0739-daily-temperatures.org
+++ b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org
@@ -1,6 +1,7 @@
 * TODO 0739. Daily Temperatures :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0739. Daily Temperatures][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0739. Daily Temperatures][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0853-car-fleet.org b/org/study_deck_02/dsa/stack/0853-car-fleet.org
similarity index 67%
rename from org/cpp/dsa/stack/0853-car-fleet.org
rename to org/study_deck_02/dsa/stack/0853-car-fleet.org
index de6a4e2..5067901 100644
--- a/org/cpp/dsa/stack/0853-car-fleet.org
+++ b/org/study_deck_02/dsa/stack/0853-car-fleet.org
@@ -1,6 +1,7 @@
 * TODO 0853. Car Fleet :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0853. Car Fleet][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0853. Car Fleet][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/0901-online-stock-span.org b/org/study_deck_02/dsa/stack/0901-online-stock-span.org
similarity index 66%
rename from org/cpp/dsa/stack/0901-online-stock-span.org
rename to org/study_deck_02/dsa/stack/0901-online-stock-span.org
index a65c3cc..1edd9d6 100644
--- a/org/cpp/dsa/stack/0901-online-stock-span.org
+++ b/org/study_deck_02/dsa/stack/0901-online-stock-span.org
@@ -1,6 +1,7 @@
 * TODO 0901. Online Stock Span :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0901. Online Stock Span][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0901. Online Stock Span][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/stack/1544-make-the-string-great.org b/org/study_deck_02/dsa/stack/1544-make-the-string-great.org
similarity index 66%
rename from org/cpp/dsa/stack/1544-make-the-string-great.org
rename to org/study_deck_02/dsa/stack/1544-make-the-string-great.org
index c1a486d..7370e13 100644
--- a/org/cpp/dsa/stack/1544-make-the-string-great.org
+++ b/org/study_deck_02/dsa/stack/1544-make-the-string-great.org
@@ -1,6 +1,7 @@
 * TODO 1544. Make The String Great :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1544. Make The String Great][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1544. Make The String Great][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0098-validate-binary-search-tree.org b/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org
similarity index 65%
rename from org/cpp/dsa/trees/0098-validate-binary-search-tree.org
rename to org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org
index 545290a..001a729 100644
--- a/org/cpp/dsa/trees/0098-validate-binary-search-tree.org
+++ b/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org
@@ -1,6 +1,7 @@
 * TODO 0098. Validate Binary Search Tree :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0098. Validate Binary Search Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0098. Validate Binary Search Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0100-same-tree.org b/org/study_deck_02/dsa/trees/0100-same-tree.org
similarity index 67%
rename from org/cpp/dsa/trees/0100-same-tree.org
rename to org/study_deck_02/dsa/trees/0100-same-tree.org
index 7f8b448..ecdc116 100644
--- a/org/cpp/dsa/trees/0100-same-tree.org
+++ b/org/study_deck_02/dsa/trees/0100-same-tree.org
@@ -1,6 +1,7 @@
 * TODO 0100. Same Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0100. Same Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0100. Same Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org b/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org
similarity index 65%
rename from org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org
rename to org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org
index 9b312a4..b221c54 100644
--- a/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org
+++ b/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org
@@ -1,6 +1,7 @@
 * TODO 0102. Binary Tree Level Order Traversal :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org b/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org
similarity index 65%
rename from org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org
rename to org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org
index d5cd7f2..4fe00cb 100644
--- a/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 0104. Maximum Depth of Binary Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org b/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
similarity index 63%
rename from org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
rename to org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
index db97a5d..aea9153 100644
--- a/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
+++ b/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
@@ -1,6 +1,7 @@
 * TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0110-balanced-binary-tree.org b/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org
similarity index 66%
rename from org/cpp/dsa/trees/0110-balanced-binary-tree.org
rename to org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org
index 297e312..1f1c9e1 100644
--- a/org/cpp/dsa/trees/0110-balanced-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 0110. Balanced Binary Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0110. Balanced Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0110. Balanced Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org b/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org
similarity index 65%
rename from org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org
rename to org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org
index ce1e03d..ce596bf 100644
--- a/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org
+++ b/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org
@@ -1,6 +1,7 @@
 * TODO 0124. Binary Tree Maximum Path Sum :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org b/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org
similarity index 65%
rename from org/cpp/dsa/trees/0199-binary-tree-right-side-view.org
rename to org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org
index 944ad67..10a0350 100644
--- a/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org
+++ b/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org
@@ -1,6 +1,7 @@
 * TODO 0199. Binary Tree Right Side View :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0199. Binary Tree Right Side View][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0199. Binary Tree Right Side View][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0226-invert-binary-tree.org b/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org
similarity index 66%
rename from org/cpp/dsa/trees/0226-invert-binary-tree.org
rename to org/study_deck_02/dsa/trees/0226-invert-binary-tree.org
index c8ca496..028a7e1 100644
--- a/org/cpp/dsa/trees/0226-invert-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 0226. Invert Binary Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0226. Invert Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0226. Invert Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org b/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org
similarity index 65%
rename from org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org
rename to org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org
index b6685c8..d8485c1 100644
--- a/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org
+++ b/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org
@@ -1,6 +1,7 @@
 * TODO 0230. Kth Smallest Element In a Bst :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org b/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
similarity index 63%
rename from org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
rename to org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
index 3160d65..6b2b52d 100644
--- a/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
+++ b/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
@@ -1,6 +1,7 @@
 * TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org b/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
similarity index 64%
rename from org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
rename to org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
index f8511ea..6cb2e9b 100644
--- a/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 0297. Serialize And Deserialize Binary Tree :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org b/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org
similarity index 65%
rename from org/cpp/dsa/trees/0543-diameter-of-binary-tree.org
rename to org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org
index 5d6d0a1..b8f9a8a 100644
--- a/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 0543. Diameter of Binary Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0543. Diameter of Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0543. Diameter of Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0572-subtree-of-another-tree.org b/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org
similarity index 65%
rename from org/cpp/dsa/trees/0572-subtree-of-another-tree.org
rename to org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org
index 28f9c09..e6458e5 100644
--- a/org/cpp/dsa/trees/0572-subtree-of-another-tree.org
+++ b/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org
@@ -1,6 +1,7 @@
 * TODO 0572. Subtree of Another Tree :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0572. Subtree of Another Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0572. Subtree of Another Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org b/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org
similarity index 65%
rename from org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org
rename to org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org
index 0608c80..d29ba27 100644
--- a/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org
+++ b/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org
@@ -1,6 +1,7 @@
 * TODO 0590. N-ary Tree Postorder Traversal :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org b/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
similarity index 64%
rename from org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
rename to org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
index a97a376..d03c3a2 100644
--- a/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
+++ b/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
@@ -1,6 +1,7 @@
 * TODO 1028. Recover a Tree From Preorder Traversal :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org b/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org
similarity index 64%
rename from org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org
rename to org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org
index 1e6b160..ae66c71 100644
--- a/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org
+++ b/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org
@@ -1,6 +1,7 @@
 * TODO 1376. Time Needed to Inform All Employees :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org b/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org
similarity index 65%
rename from org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org
rename to org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org
index 5310bcd..290ddc8 100644
--- a/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org
+++ b/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org
@@ -1,6 +1,7 @@
 * TODO 1448. Count Good Nodes In Binary Tree :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org b/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org
similarity index 65%
rename from org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org
rename to org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org
index 3b81e3b..0737fdb 100644
--- a/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org
+++ b/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org
@@ -1,6 +1,7 @@
 * TODO 0208. Implement Trie Prefix Tree :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org b/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org
similarity index 64%
rename from org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org
rename to org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org
index e78e8ba..ad63c5a 100644
--- a/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org
+++ b/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org
@@ -1,6 +1,7 @@
 * TODO 0211. Design Add And Search Words Data Structure :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/tries/0212-word-search-ii.org b/org/study_deck_02/dsa/tries/0212-word-search-ii.org
similarity index 66%
rename from org/cpp/dsa/tries/0212-word-search-ii.org
rename to org/study_deck_02/dsa/tries/0212-word-search-ii.org
index 30d7cdc..801c306 100644
--- a/org/cpp/dsa/tries/0212-word-search-ii.org
+++ b/org/study_deck_02/dsa/tries/0212-word-search-ii.org
@@ -1,6 +1,7 @@
 * TODO 0212. Word Search II :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0212. Word Search II][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0212. Word Search II][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/tries/1166-design-file-system.org b/org/study_deck_02/dsa/tries/1166-design-file-system.org
similarity index 66%
rename from org/cpp/dsa/tries/1166-design-file-system.org
rename to org/study_deck_02/dsa/tries/1166-design-file-system.org
index 90992f9..bed9cc3 100644
--- a/org/cpp/dsa/tries/1166-design-file-system.org
+++ b/org/study_deck_02/dsa/tries/1166-design-file-system.org
@@ -1,6 +1,7 @@
 * TODO 1166. Design File System :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1166. Design File System][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*1166. Design File System][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0011-container-with-most-water.org b/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org
similarity index 65%
rename from org/cpp/dsa/two-pointers/0011-container-with-most-water.org
rename to org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org
index a431d63..00edb3b 100644
--- a/org/cpp/dsa/two-pointers/0011-container-with-most-water.org
+++ b/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org
@@ -1,6 +1,7 @@
 * TODO 0011. Container With Most Water :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0011. Container With Most Water][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0011. Container With Most Water][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0015-3sum.org b/org/study_deck_02/dsa/two-pointers/0015-3sum.org
similarity index 68%
rename from org/cpp/dsa/two-pointers/0015-3sum.org
rename to org/study_deck_02/dsa/two-pointers/0015-3sum.org
index 6135784..ba2a62b 100644
--- a/org/cpp/dsa/two-pointers/0015-3sum.org
+++ b/org/study_deck_02/dsa/two-pointers/0015-3sum.org
@@ -1,6 +1,7 @@
 * TODO 0015. 3Sum :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0015. 3Sum][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0015. 3Sum][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org b/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org
similarity index 66%
rename from org/cpp/dsa/two-pointers/0042-trapping-rain-water.org
rename to org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org
index 12aa12a..d9c466d 100644
--- a/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org
+++ b/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org
@@ -1,6 +1,7 @@
 * TODO 0042. Trapping Rain Water :hard:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0042. Trapping Rain Water][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0042. Trapping Rain Water][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0125-valid-palindrome.org b/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org
similarity index 66%
rename from org/cpp/dsa/two-pointers/0125-valid-palindrome.org
rename to org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org
index b92c51c..0afb54a 100644
--- a/org/cpp/dsa/two-pointers/0125-valid-palindrome.org
+++ b/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org
@@ -1,6 +1,7 @@
 * TODO 0125. Valid Palindrome :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0125. Valid Palindrome][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0125. Valid Palindrome][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org b/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
similarity index 65%
rename from org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
rename to org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
index fa17c4b..1d6721e 100644
--- a/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
+++ b/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
@@ -1,6 +1,7 @@
 * TODO 0167. Two Sum II Input Array Is Sorted :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0259-3sum-smaller.org b/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org
similarity index 67%
rename from org/cpp/dsa/two-pointers/0259-3sum-smaller.org
rename to org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org
index 76ba1cd..aec2445 100644
--- a/org/cpp/dsa/two-pointers/0259-3sum-smaller.org
+++ b/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org
@@ -1,6 +1,7 @@
 * TODO 0259. 3Sum Smaller :medium:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0259. 3Sum Smaller][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0259. 3Sum Smaller][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/two-pointers/0344-reverse-string.org b/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org
similarity index 66%
rename from org/cpp/dsa/two-pointers/0344-reverse-string.org
rename to org/study_deck_02/dsa/two-pointers/0344-reverse-string.org
index 5c0ff0b..49645ed 100644
--- a/org/cpp/dsa/two-pointers/0344-reverse-string.org
+++ b/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org
@@ -1,6 +1,7 @@
 * TODO 0344. Reverse String :easy:
+#+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0344. Reverse String][Roadmap]]
+:NEETCODE: [[../../roadmap.org::*0344. Reverse String][Roadmap]]
 :END:
 
 ** TODO Approach
diff --git a/org/cpp/dsa/udfs.org b/org/study_deck_02/dsa/udfs.org
similarity index 97%
rename from org/cpp/dsa/udfs.org
rename to org/study_deck_02/dsa/udfs.org
index 13665cd..81ebd60 100644
--- a/org/cpp/dsa/udfs.org
+++ b/org/study_deck_02/dsa/udfs.org
@@ -1,4 +1,5 @@
 #+title: Udfs
+#+PROPERTY: STUDY_DECK_02
 * impl
 #+begin_src cpp
 #include <vector>
diff --git a/org/study_deck_02/roadmap.org b/org/study_deck_02/roadmap.org
new file mode 100644
index 0000000..e057063
--- /dev/null
+++ b/org/study_deck_02/roadmap.org
@@ -0,0 +1,1647 @@
+#+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:
+Notes: [[dsa/arrays-hashing/0217-contains-duplicate.org][My Solution]]
+** TODO 0242. Valid Anagram :easy:
+:PROPERTIES:
+:LEETCODE: [[https://leetcode.com/problems/valid-anagram/][Problem]]
+:CPP:      [[https://github.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:
+Notes: [[dsa/arrays-hashing/0242-valid-anagram.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/2678-number-of-senior-citizens.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0001-two-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/1408-string-matching-in-an-array.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0049-group-anagrams.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0347-top-k-frequent-elements.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0271-encode-and-decode-strings.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0238-product-of-array-except-self.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0036-valid-sudoku.org][My Solution]]
+** 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:
+Notes: [[dsa/arrays-hashing/0128-longest-consecutive-sequence.org][My Solution]]
+
+* 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:
+Notes: [[dsa/two-pointers/0344-reverse-string.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0125-valid-palindrome.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0015-3sum.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0011-container-with-most-water.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0259-3sum-smaller.org][My Solution]]
+** 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:
+Notes: [[dsa/two-pointers/0042-trapping-rain-water.org][My Solution]]
+
+* 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:
+Notes: [[dsa/binary-search/0704-binary-search.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0074-search-a-2d-matrix.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0875-koko-eating-bananas.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0033-search-in-rotated-sorted-array.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0981-time-based-key-value-store.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0719-find-k-th-smallest-pair-distance.org][My Solution]]
+** 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:
+Notes: [[dsa/binary-search/0004-median-of-two-sorted-arrays.org][My Solution]]
+
+* 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:
+Notes: [[dsa/stack/0682-baseball-game.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0020-valid-parentheses.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/1544-make-the-string-great.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0155-min-stack.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0150-evaluate-reverse-polish-notation.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0739-daily-temperatures.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0901-online-stock-span.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0853-car-fleet.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0084-largest-rectangle-in-histogram.org][My Solution]]
+** 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:
+Notes: [[dsa/stack/0726-number-of-atoms.org][My Solution]]
+
+* 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:
+Notes: [[dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/0003-longest-substring-without-repeating-characters.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/0424-longest-repeating-character-replacement.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/0567-permutation-in-string.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/0076-minimum-window-substring.org][My Solution]]
+** 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:
+Notes: [[dsa/sliding-window/0239-sliding-window-maximum.org][My Solution]]
+
+* 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:
+Notes: [[dsa/linked-list/0206-reverse-linked-list.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0021-merge-two-sorted-lists.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0141-linked-list-cycle.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/2487-remove-nodes-from-linked-list.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0143-reorder-list.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0019-remove-nth-node-from-end-of-list.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0138-copy-list-with-random-pointer.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/1472-design-browser-history.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0002-add-two-numbers.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0287-find-the-duplicate-number.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0725-split-linked-list-in-parts.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0146-lru-cache.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0023-merge-k-sorted-lists.org][My Solution]]
+** 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:
+Notes: [[dsa/linked-list/0025-reverse-nodes-in-k-group.org][My Solution]]
+
+* 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:
+Notes: [[dsa/trees/0590-n-ary-tree-postorder-traversal.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0226-invert-binary-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0104-maximum-depth-of-binary-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0543-diameter-of-binary-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0110-balanced-binary-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0100-same-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0572-subtree-of-another-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0102-binary-tree-level-order-traversal.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0199-binary-tree-right-side-view.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/1376-time-needed-to-inform-all-employees.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/1448-count-good-nodes-in-binary-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0098-validate-binary-search-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0230-kth-smallest-element-in-a-bst.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/1028-recover-a-tree-from-preorder-traversal.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0124-binary-tree-maximum-path-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/trees/0297-serialize-and-deserialize-binary-tree.org][My Solution]]
+
+* 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:
+Notes: [[dsa/tries/0208-implement-trie-prefix-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/tries/0211-design-add-and-search-words-data-structure.org][My Solution]]
+** 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:
+Notes: [[dsa/tries/1166-design-file-system.org][My Solution]]
+** 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:
+Notes: [[dsa/tries/0212-word-search-ii.org][My Solution]]
+
+* 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:
+Notes: [[dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/1046-last-stone-weight.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/0973-k-closest-points-to-origin.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/0621-task-scheduler.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/0355-design-twitter.org][My Solution]]
+** 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:
+Notes: [[dsa/heap-priority-queue/0295-find-median-from-data-stream.org][My Solution]]
+
+* 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:
+Notes: [[dsa/backtracking/1863-sum-of-all-subset-xor-totals.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0078-subsets.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0039-combination-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0040-combination-sum-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0077-combinations.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0046-permutations.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0090-subsets-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0022-generate-parentheses.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/1079-letter-tile-possibilities.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0079-word-search.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0131-palindrome-partitioning.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0017-letter-combinations-of-a-phone-number.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0351-android-unlock-patterns.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0051-n-queens.org][My Solution]]
+** 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:
+Notes: [[dsa/backtracking/0052-n-queens-ii.org][My Solution]]
+
+* 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:
+Notes: [[dsa/graphs/2924-find-champion-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0200-number-of-islands.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0695-max-area-of-island.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0133-clone-graph.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0286-walls-and-gates.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0994-rotting-oranges.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/1905-count-sub-islands.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0417-pacific-atlantic-water-flow.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0130-surrounded-regions.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0802-find-eventual-safe-states.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0207-course-schedule.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0210-course-schedule-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0261-graph-valid-tree.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0684-redundant-connection.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/2092-find-all-people-with-secret.org][My Solution]]
+** 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:
+Notes: [[dsa/graphs/0127-word-ladder.org][My Solution]]
+
+* 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:
+Notes: [[dsa/1-d-dynamic-programming/0070-climbing-stairs.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0198-house-robber.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0213-house-robber-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0647-palindromic-substrings.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0091-decode-ways.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0322-coin-change.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0139-word-break.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/1-d-dynamic-programming/0656-coin-path.org][My Solution]]
+
+* 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:
+Notes: [[dsa/intervals/0057-insert-interval.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/0056-merge-intervals.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/0435-non-overlapping-intervals.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/0986-interval-list-intersections.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/0252-meeting-rooms.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/0253-meeting-rooms-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/intervals/1851-minimum-interval-to-include-each-query.org][My Solution]]
+
+* 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:
+Notes: [[dsa/greedy/0945-minimum-increment-to-make-array-unique.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0053-maximum-subarray.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0978-longest-turbulent-subarray.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0055-jump-game.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0045-jump-game-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/1871-jump-game-vii.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0134-gas-station.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0846-hand-of-straights.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/1899-merge-triplets-to-form-target-triplet.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0763-partition-labels.org][My Solution]]
+** 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:
+Notes: [[dsa/greedy/0678-valid-parenthesis-string.org][My Solution]]
+
+* 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:
+Notes: [[dsa/advanced-graphs/0743-network-delay-time.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/0332-reconstruct-itinerary.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/0778-swim-in-rising-water.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/0269-alien-dictionary.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org][My Solution]]
+** 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:
+Notes: [[dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org][My Solution]]
+
+* 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:
+Notes: [[dsa/bit-manipulation/0136-single-number.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0260-single-number-iii.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0191-number-of-1-bits.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0338-counting-bits.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0190-reverse-bits.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0268-missing-number.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0231-power-of-two.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0371-sum-of-two-integers.org][My Solution]]
+** 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:
+Notes: [[dsa/bit-manipulation/0007-reverse-integer.org][My Solution]]
+
+* 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:
+Notes: [[dsa/math-geometry/0840-magic-squares-in-grid.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0048-rotate-image.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0054-spiral-matrix.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/2326-spiral-matrix-iv.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0073-set-matrix-zeroes.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0202-happy-number.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0066-plus-one.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0009-palindrome-number.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0012-integer-to-roman.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0050-powx-n.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0043-multiply-strings.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/2013-detect-squares.org][My Solution]]
+** 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:
+Notes: [[dsa/math-geometry/0296-best-meeting-point.org][My Solution]]
+
+* 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:
+Notes: [[dsa/2-d-dynamic-programming/0062-unique-paths.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0518-coin-change-ii.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0494-target-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0097-interleaving-string.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0115-distinct-subsequences.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0072-edit-distance.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0312-burst-balloons.org][My Solution]]
+** 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:
+Notes: [[dsa/2-d-dynamic-programming/0010-regular-expression-matching.org][My Solution]]