Add solution notes scaffold and sub-heading format

- roadmap.org: problems now have *** Python and *** C++ sub-headings,
  plus Notes: links to per-problem org files
- scaffold-notes.mjs: creates 199 note files in org/cpp/dsa/<topic>/
  with backlinks to roadmap.org
- 18 topic folders under org/cpp/dsa/ for NeetCode 150 problems
- Updated AGENTS.md with new conventions and workflow

AGENTS.md

@@ -34,6 +34,13 @@ 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)
+
+## 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
+- Each links to the other via org file links
+- Problem tags (`:easy:`, `:medium:`, `:hard:`) enable filtering with `/ t`
 
 ## Active Context
 <!-- AI assistant maintains this section. Keep under 20 lines. -->

leetcode/AGENTS.md

@@ -68,9 +68,28 @@ Arrays & Hashing
 ## Org-Mode Format
 
 Each topic is a `* TODO` heading with a `[/]` cookie for progress.
-Problems are `- [ ] TODO` items with difficulty tags (`:easy:`,
+Problems are `** TODO` sub-headings with difficulty tags (`:easy:`,
-`:medium:`, `:hard:`). Python and C++ solution links are nested
+`:medium:`, `:hard:`). Python and C++ solution links are `***` sub-headings
-`- [ ] TODO` sub-items. LeetCode and video links are plain list items.
+under each problem. Each problem also links to a notes file at
+`org/cpp/dsa/<topic>/<problem>.org` for personal solutions and flashcards.
+
+### Notes Files
+
+`org/cpp/dsa/<topic>/<code>.org` — one per NeetCode 150 problem (199 total).
+Scaffolded by `scaffold-notes.mjs`. Template:
+
+```org
+* TODO 0217. Contains Duplicate :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src
+```
+
+Run `node scaffold-notes.mjs` to create missing note files (skips existing).
 
 ## Updating
 

leetcode/extract.mjs

@@ -207,10 +207,19 @@ function buildOrg(sortedNodes, problemsByTopic) {
   const difficultyTag = (d) =>
     d === "Easy" ? "easy" : d === "Medium" ? "medium" : "hard";
 
+  const topicSlug = (name) =>
+    name
+      .toLowerCase()
+      .replace(/[^a-z0-9]+/g, "-")
+      .replace(/(^-|-$)/g, "");
+
+  const notesRoot = "../../org/cpp/dsa";
+
   for (const node of sortedNodes) {
     const topicProblems = (problemsByTopic[node.name] || []).filter(
       (p) => p.neetcode150
     );
+    const slug = topicSlug(node.name);
     lines.push(`* TODO ${node.name} [/]`);
     lines.push("");
 
@@ -224,14 +233,18 @@ function buildOrg(sortedNodes, problemsByTopic) {
       const tag = difficultyTag(p.difficulty);
       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(`- Python: [[${GITHUB_SOLUTIONS}python/${p.code}.py][${p.code}.py]]`);
+      lines.push(`*** Python`);
-      lines.push(`- C++: [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][${p.code}.cpp]]`);
+      lines.push(`- [[${GITHUB_SOLUTIONS}python/${p.code}.py][${p.code}.py]]`);
+      lines.push(`*** C++`);
+      lines.push(`- [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][${p.code}.cpp]]`);
       lines.push(`- LeetCode: [[${lcUrl}][${p.link}]]`);
       if (p.video)
         lines.push(
           `- Video: [[https://youtube.com/watch?v=${p.video}][explanation]]`
         );
+      lines.push(`- Notes: [[${notesFile}][My Solution]]`);
     }
     lines.push("");
   }

leetcode/scaffold-notes.mjs

@@ -0,0 +1,55 @@
+import { readFileSync, writeFileSync, existsSync } from "node:fs";
+import { join, dirname } from "node:path";
+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 topicSlug = (name) =>
+  name
+    .toLowerCase()
+    .replace(/[^a-z0-9]+/g, "-")
+    .replace(/(^-|-$)/g, "");
+
+let currentTopic = "";
+let count = 0;
+
+for (const line of roadmap.split("\n")) {
+  const topicMatch = line.match(/^\* TODO (.+?) \[/);
+  if (topicMatch) {
+    currentTopic = topicSlug(topicMatch[1]);
+    continue;
+  }
+
+  const problemMatch = line.match(
+    /^\*\* TODO (\d+)\. (.+?) :(easy|medium|hard):$/
+  );
+  if (problemMatch) {
+    const [, num, name, diff] = problemMatch;
+    const slug = name
+      .toLowerCase()
+      .replace(/[^a-z0-9]+/g, "-")
+      .replace(/(^-|-$)/g, "");
+    const code = `${num}-${slug}`;
+    const filePath = join(dsaDir, currentTopic, `${code}.org`);
+
+    if (existsSync(filePath)) continue;
+
+    const relPath = `../../../../leetcode/out/roadmap.org::*${num}. ${name}`;
+    const content = `* TODO ${num}. ${name} :${diff}:
+:PROPERTIES:
+:NEETCODE: [[${relPath}][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src
+`;
+    writeFileSync(filePath, content);
+    count++;
+  }
+}
+
+console.log(`Created ${count} note files`);

org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org

@@ -0,0 +1,8 @@
+* TODO 0005. Longest Palindromic Substring :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org

@@ -0,0 +1,8 @@
+* TODO 0070. Climbing Stairs :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0070. Climbing Stairs][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org

@@ -0,0 +1,8 @@
+* TODO 0091. Decode Ways :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0091. Decode Ways][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org

@@ -0,0 +1,8 @@
+* TODO 0139. Word Break :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0139. Word Break][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org

@@ -0,0 +1,8 @@
+* TODO 0152. Maximum Product Subarray :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org

@@ -0,0 +1,8 @@
+* TODO 0198. House Robber :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0198. House Robber][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org

@@ -0,0 +1,8 @@
+* TODO 0213. House Robber II :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0213. House Robber II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org

@@ -0,0 +1,8 @@
+* TODO 0300. Longest Increasing Subsequence :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org

@@ -0,0 +1,8 @@
+* TODO 0322. Coin Change :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0322. Coin Change][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org

@@ -0,0 +1,8 @@
+* TODO 0416. Partition Equal Subset Sum :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org

@@ -0,0 +1,8 @@
+* TODO 0647. Palindromic Substrings :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0647. Palindromic Substrings][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org

@@ -0,0 +1,8 @@
+* TODO 0656. Coin Path :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0656. Coin Path][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org

@@ -0,0 +1,8 @@
+* TODO 0746. Min Cost Climbing Stairs :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org

@@ -0,0 +1,8 @@
+* TODO 0010. Regular Expression Matching :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0010. Regular Expression Matching][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org

@@ -0,0 +1,8 @@
+* TODO 0062. Unique Paths :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0062. Unique Paths][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org

@@ -0,0 +1,8 @@
+* TODO 0072. Edit Distance :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0072. Edit Distance][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org

@@ -0,0 +1,8 @@
+* TODO 0097. Interleaving String :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0097. Interleaving String][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org

@@ -0,0 +1,8 @@
+* TODO 0115. Distinct Subsequences :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0115. Distinct Subsequences][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org

@@ -0,0 +1,8 @@
+* TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org

@@ -0,0 +1,8 @@
+* TODO 0312. Burst Balloons :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0312. Burst Balloons][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org

@@ -0,0 +1,8 @@
+* TODO 0329. Longest Increasing Path In a Matrix :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org

@@ -0,0 +1,8 @@
+* TODO 0494. Target Sum :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0494. Target Sum][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org

@@ -0,0 +1,8 @@
+* TODO 0518. Coin Change II :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0518. Coin Change II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org

@@ -0,0 +1,8 @@
+* TODO 1143. Longest Common Subsequence :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org

@@ -0,0 +1,8 @@
+* TODO 1220. Count Vowels Permutation :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org

@@ -0,0 +1,8 @@
+* TODO 1911. Maximum Alternating Subsequence Sum :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org

@@ -0,0 +1,8 @@
+* TODO 0269. Alien Dictionary :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0269. Alien Dictionary][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org

@@ -0,0 +1,8 @@
+* TODO 0332. Reconstruct Itinerary :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/0743-network-delay-time.org

@@ -0,0 +1,8 @@
+* TODO 0743. Network Delay Time :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0743. Network Delay Time][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org

@@ -0,0 +1,8 @@
+* TODO 0778. Swim In Rising Water :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0778. Swim In Rising Water][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org

@@ -0,0 +1,8 @@
+* TODO 0787. Cheapest Flights Within K Stops :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org

@@ -0,0 +1,8 @@
+* TODO 1584. Min Cost to Connect All Points :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org

@@ -0,0 +1,8 @@
+* TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org

@@ -0,0 +1,8 @@
+* TODO 2812. Find the Safest Path in a Grid :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0001-two-sum.org

@@ -0,0 +1,8 @@
+* TODO 0001. Two Sum :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0001. Two Sum][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org

@@ -0,0 +1,8 @@
+* TODO 0036. Valid Sudoku :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0036. Valid Sudoku][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0049-group-anagrams.org

@@ -0,0 +1,8 @@
+* TODO 0049. Group Anagrams :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0049. Group Anagrams][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org

@@ -0,0 +1,8 @@
+* TODO 0128. Longest Consecutive Sequence :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org

@@ -0,0 +1,8 @@
+* TODO 0217. Contains Duplicate :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org

@@ -0,0 +1,8 @@
+* TODO 0238. Product of Array Except Self :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0238. Product of Array Except Self][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0242-valid-anagram.org

@@ -0,0 +1,8 @@
+* TODO 0242. Valid Anagram :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0242. Valid Anagram][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org

@@ -0,0 +1,8 @@
+* TODO 0271. Encode and Decode Strings :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org

@@ -0,0 +1,8 @@
+* TODO 0347. Top K Frequent Elements :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org

@@ -0,0 +1,8 @@
+* TODO 1408. String Matching in an Array :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1408. String Matching in an Array][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org

@@ -0,0 +1,8 @@
+* TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org

@@ -0,0 +1,8 @@
+* TODO 2678. Number of Senior Citizens :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org

@@ -0,0 +1,8 @@
+* TODO 0017. Letter Combinations of a Phone Number :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0022-generate-parentheses.org

@@ -0,0 +1,8 @@
+* TODO 0022. Generate Parentheses :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0022. Generate Parentheses][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0039-combination-sum.org

@@ -0,0 +1,8 @@
+* TODO 0039. Combination Sum :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0039. Combination Sum][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0040-combination-sum-ii.org

@@ -0,0 +1,8 @@
+* TODO 0040. Combination Sum II :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0040. Combination Sum II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0046-permutations.org

@@ -0,0 +1,8 @@
+* TODO 0046. Permutations :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0046. Permutations][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0051-n-queens.org

@@ -0,0 +1,8 @@
+* TODO 0051. N Queens :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0051. N Queens][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0052-n-queens-ii.org

@@ -0,0 +1,8 @@
+* TODO 0052. N Queens II :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0052. N Queens II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0077-combinations.org

@@ -0,0 +1,8 @@
+* TODO 0077. Combinations :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0077. Combinations][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0078-subsets.org

@@ -0,0 +1,8 @@
+* TODO 0078. Subsets :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0078. Subsets][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0079-word-search.org

@@ -0,0 +1,8 @@
+* TODO 0079. Word Search :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0079. Word Search][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0090-subsets-ii.org

@@ -0,0 +1,8 @@
+* TODO 0090. Subsets II :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0090. Subsets II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0131-palindrome-partitioning.org

@@ -0,0 +1,8 @@
+* TODO 0131. Palindrome Partitioning :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/0351-android-unlock-patterns.org

@@ -0,0 +1,8 @@
+* TODO 0351. Android Unlock Patterns :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org

@@ -0,0 +1,8 @@
+* TODO 1079. Letter Tile Possibilities :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org

@@ -0,0 +1,8 @@
+* TODO 1863. Sum of All Subsets XOR Total :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org

@@ -0,0 +1,8 @@
+* TODO 0004. Median of Two Sorted Arrays :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org

@@ -0,0 +1,8 @@
+* TODO 0033. Search In Rotated Sorted Array :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org

@@ -0,0 +1,8 @@
+* TODO 0074. Search a 2D Matrix :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org

@@ -0,0 +1,8 @@
+* TODO 0153. Find Minimum In Rotated Sorted Array :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0704-binary-search.org

@@ -0,0 +1,8 @@
+* TODO 0704. Binary Search :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0704. Binary Search][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org

@@ -0,0 +1,8 @@
+* TODO 0719. Find K-th Smallest Pair Distance :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0875-koko-eating-bananas.org

@@ -0,0 +1,8 @@
+* TODO 0875. Koko Eating Bananas :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/0981-time-based-key-value-store.org

@@ -0,0 +1,8 @@
+* TODO 0981. Time Based Key Value Store :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org

@@ -0,0 +1,8 @@
+* TODO 2300. Successful Pairs of Spells and Potions :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0007-reverse-integer.org

@@ -0,0 +1,8 @@
+* TODO 0007. Reverse Integer :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0007. Reverse Integer][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0136-single-number.org

@@ -0,0 +1,8 @@
+* TODO 0136. Single Number :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0136. Single Number][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0190-reverse-bits.org

@@ -0,0 +1,8 @@
+* TODO 0190. Reverse Bits :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0190. Reverse Bits][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org

@@ -0,0 +1,8 @@
+* TODO 0191. Number of 1 Bits :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0191. Number of 1 Bits][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0231-power-of-two.org

@@ -0,0 +1,8 @@
+* TODO 0231. Power of Two :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0231. Power of Two][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0260-single-number-iii.org

@@ -0,0 +1,8 @@
+* TODO 0260. Single Number III :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0260. Single Number III][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0268-missing-number.org

@@ -0,0 +1,8 @@
+* TODO 0268. Missing Number :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0268. Missing Number][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0338-counting-bits.org

@@ -0,0 +1,8 @@
+* TODO 0338. Counting Bits :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0338. Counting Bits][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org

@@ -0,0 +1,8 @@
+* TODO 0371. Sum of Two Integers :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0371. Sum of Two Integers][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org

@@ -0,0 +1,8 @@
+* TODO 2220. Minimum Bit Flips to Convert Number :easy:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0127-word-ladder.org

@@ -0,0 +1,8 @@
+* TODO 0127. Word Ladder :hard:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0127. Word Ladder][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0130-surrounded-regions.org

@@ -0,0 +1,8 @@
+* TODO 0130. Surrounded Regions :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0130. Surrounded Regions][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0133-clone-graph.org

@@ -0,0 +1,8 @@
+* TODO 0133. Clone Graph :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0133. Clone Graph][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0200-number-of-islands.org

@@ -0,0 +1,8 @@
+* TODO 0200. Number of Islands :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0200. Number of Islands][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0207-course-schedule.org

@@ -0,0 +1,8 @@
+* TODO 0207. Course Schedule :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0207. Course Schedule][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0210-course-schedule-ii.org

@@ -0,0 +1,8 @@
+* TODO 0210. Course Schedule II :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0210. Course Schedule II][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0261-graph-valid-tree.org

@@ -0,0 +1,8 @@
+* TODO 0261. Graph Valid Tree :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0261. Graph Valid Tree][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0286-walls-and-gates.org

@@ -0,0 +1,8 @@
+* TODO 0286. Walls And Gates :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0286. Walls And Gates][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org

@@ -0,0 +1,8 @@
+* TODO 0323. Number of Connected Components In An Undirected Graph :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org

@@ -0,0 +1,8 @@
+* TODO 0417. Pacific Atlantic Water Flow :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0684-redundant-connection.org

@@ -0,0 +1,8 @@
+* TODO 0684. Redundant Connection :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0684. Redundant Connection][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0695-max-area-of-island.org

@@ -0,0 +1,8 @@
+* TODO 0695. Max Area of Island :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0695. Max Area of Island][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0802-find-eventual-safe-states.org

@@ -0,0 +1,8 @@
+* TODO 0802. Find Eventual Safe States :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0802. Find Eventual Safe States][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/0994-rotting-oranges.org

@@ -0,0 +1,8 @@
+* TODO 0994. Rotting Oranges :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*0994. Rotting Oranges][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src

org/cpp/dsa/graphs/1905-count-sub-islands.org

@@ -0,0 +1,8 @@
+* TODO 1905. Count Sub Islands :medium:
+:PROPERTIES:
+:NEETCODE: [[../../../../leetcode/out/roadmap.org::*1905. Count Sub Islands][Roadmap]]
+:END:
+
+#+begin_src cpp
+
+#+end_src