refactor: move DSA notes to org/study_deck_02/

Restructure NeetCode study materials into a dedicated Anki-exportable deck directory. Separates DSA problem notes from C++ flashcards. - Move roadmap.org from leetcode/out/ to org/study_deck_02/ - Move 200 note files from org/cpp/dsa/ to org/study_deck_02/dsa/ - Add #+PROPERTY: STUDY_DECK_02 to all org files for org-anki export - Simplify roadmap format: properties drawer replaces nested headings - Update NEETCODE backlinks in all note files - Update extract.mjs and scaffold-notes.mjs for new paths - Create org/study_deck_02/AGENTS.md with study workflow docs - Update root and leetcode AGENTS.md
Expand progress cookies (org-mode auto-update)
2026-06-01 16:12:21 +08:00 · 2026-06-01 02:41:53 +08:00 · 2026-06-01 02:39:53 +08:00 · 2026-06-01 02:33:30 +08:00 · 2026-06-01 02:22:17 +08:00
209 changed files with 5480 additions and 1065 deletions
@@ -34,11 +34,20 @@ 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/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
+- `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`

 ## Active Context
 <!-- 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`
@@ -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) |

@@ -68,9 +68,30 @@ Arrays & Hashing
 ## Org-Mode Format

 Each topic is a `* TODO` heading with a `[/]` cookie for progress.
-Problems are `- [ ] TODO` items with difficulty tags (`:easy:`,
-`:medium:`, `:hard:`). Python and C++ solution links are nested
-`- [ ] TODO` sub-items. LeetCode and video links are plain list items.
+Problems are `** TODO` sub-headings with difficulty tags (`:easy:`,
+`: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/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: [[../../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

@@ -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");
@@ -207,10 +208,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 = "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 +234,18 @@ function buildOrg(sortedNodes, problemsByTopic) {
      const tag = difficultyTag(p.difficulty);
      const lcUrl = `${LEETCODE_BASE}${p.link}`;
      const num = p.code.split("-")[0];
-      lines.push(`- [ ] TODO ${num}. ${p.name} :${tag}:`);
-      lines.push(`  - [ ] TODO Python: [[${GITHUB_SOLUTIONS}python/${p.code}.py][${p.code}.py]]`);
-      lines.push(`  - [ ] TODO C++: [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][${p.code}.cpp]]`);
-      lines.push(`  - LeetCode: [[${lcUrl}][${p.link}]]`);
+      const notesFile = `${notesRoot}/${slug}/${p.code}.org`;
+      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(`:END:`);
+      lines.push(`Notes: [[${notesFile}][My Solution]]`);
    }
    lines.push("");
  }
@@ -330,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"
    );
@@ -340,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`
    );
@@ -1,6 +1,6 @@
 {
  "source": "https://neetcode.io/roadmap",
-  "extracted": "2026-05-31",
+  "extracted": "2026-06-01",
  "graph": {
    "nodes": [
      {
@@ -1,6 +1,6 @@
 {
  "source": "https://neetcode.io/roadmap",
-  "extracted": "2026-05-31",
+  "extracted": "2026-06-01",
  "graph": {
    "nodes": [
      {
@@ -0,0 +1,65 @@
+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, "../org/study_deck_02/roadmap.org"), "utf8");
+const dsaDir = join(__dirname, "../org/study_deck_02/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 = `../../roadmap.org::*${num}. ${name}`;
+    const content = `* TODO ${num}. ${name} :${diff}:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[${relPath}][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
+`;
+    writeFileSync(filePath, content);
+    count++;
+  }
+}
+
+console.log(`Created ${count} note files`);
@@ -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).
@@ -0,0 +1,18 @@
+* TODO 0005. Longest Palindromic Substring :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0070. Climbing Stairs :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0070. Climbing Stairs][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0091. Decode Ways :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0091. Decode Ways][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0139. Word Break :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0139. Word Break][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0152. Maximum Product Subarray :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0198. House Robber :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0198. House Robber][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0213. House Robber II :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0213. House Robber II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0300. Longest Increasing Subsequence :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0322. Coin Change :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0322. Coin Change][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0416. Partition Equal Subset Sum :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0647. Palindromic Substrings :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0647. Palindromic Substrings][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0656. Coin Path :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0656. Coin Path][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0746. Min Cost Climbing Stairs :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0010. Regular Expression Matching :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0010. Regular Expression Matching][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0062. Unique Paths :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0062. Unique Paths][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0072. Edit Distance :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0072. Edit Distance][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0097. Interleaving String :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0097. Interleaving String][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0115. Distinct Subsequences :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0115. Distinct Subsequences][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0312. Burst Balloons :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0312. Burst Balloons][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0329. Longest Increasing Path In a Matrix :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0494. Target Sum :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0494. Target Sum][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0518. Coin Change II :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0518. Coin Change II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1143. Longest Common Subsequence :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1220. Count Vowels Permutation :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1911. Maximum Alternating Subsequence Sum :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0269. Alien Dictionary :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0269. Alien Dictionary][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0332. Reconstruct Itinerary :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0743. Network Delay Time :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0743. Network Delay Time][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0778. Swim In Rising Water :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0778. Swim In Rising Water][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0787. Cheapest Flights Within K Stops :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1584. Min Cost to Connect All Points :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 2812. Find the Safest Path in a Grid :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0001. Two Sum :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0001. Two Sum][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0036. Valid Sudoku :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0036. Valid Sudoku][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0049. Group Anagrams :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../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
@@ -0,0 +1,18 @@
+* TODO 0128. Longest Consecutive Sequence :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* 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
@@ -0,0 +1,18 @@
+* TODO 0238. Product of Array Except Self :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0238. Product of Array Except Self][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0242. Valid Anagram :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0242. Valid Anagram][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0271. Encode and Decode Strings :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0347. Top K Frequent Elements :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1408. String Matching in an Array :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1408. String Matching in an Array][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 2678. Number of Senior Citizens :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0017. Letter Combinations of a Phone Number :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0022. Generate Parentheses :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0022. Generate Parentheses][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0039. Combination Sum :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0039. Combination Sum][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0040. Combination Sum II :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0040. Combination Sum II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0046. Permutations :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0046. Permutations][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0051. N Queens :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0051. N Queens][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0052. N Queens II :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0052. N Queens II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0077. Combinations :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0077. Combinations][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0078. Subsets :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0078. Subsets][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0079. Word Search :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0079. Word Search][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0090. Subsets II :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0090. Subsets II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0131. Palindrome Partitioning :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0351. Android Unlock Patterns :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1079. Letter Tile Possibilities :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 1863. Sum of All Subsets XOR Total :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0004. Median of Two Sorted Arrays :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0033. Search In Rotated Sorted Array :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0074. Search a 2D Matrix :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0153. Find Minimum In Rotated Sorted Array :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0704. Binary Search :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0704. Binary Search][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0719. Find K-th Smallest Pair Distance :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0875. Koko Eating Bananas :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0981. Time Based Key Value Store :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 2300. Successful Pairs of Spells and Potions :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0007. Reverse Integer :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0007. Reverse Integer][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0136. Single Number :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0136. Single Number][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0190. Reverse Bits :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0190. Reverse Bits][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0191. Number of 1 Bits :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0191. Number of 1 Bits][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0231. Power of Two :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0231. Power of Two][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0260. Single Number III :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0260. Single Number III][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -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
@@ -0,0 +1,18 @@
+* TODO 0338. Counting Bits :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0338. Counting Bits][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0371. Sum of Two Integers :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0371. Sum of Two Integers][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 2220. Minimum Bit Flips to Convert Number :easy:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0127. Word Ladder :hard:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0127. Word Ladder][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0130. Surrounded Regions :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0130. Surrounded Regions][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0133. Clone Graph :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0133. Clone Graph][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0200. Number of Islands :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0200. Number of Islands][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0207. Course Schedule :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0207. Course Schedule][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0210. Course Schedule II :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0210. Course Schedule II][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0261. Graph Valid Tree :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0261. Graph Valid Tree][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0286. Walls And Gates :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0286. Walls And Gates][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0323. Number of Connected Components In An Undirected Graph :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0417. Pacific Atlantic Water Flow :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0684. Redundant Connection :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0684. Redundant Connection][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
@@ -0,0 +1,18 @@
+* TODO 0695. Max Area of Island :medium:
+#+PROPERTY: STUDY_DECK_02
+:PROPERTIES:
+:NEETCODE: [[../../roadmap.org::*0695. Max Area of Island][Roadmap]]
+:END:
+
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
+#+begin_src cpp
+
+#+end_src
--- a/Show More
+++ b/Show More
Author	SHA1	Message	Date
tomatocream	dfadc1ca48	refactor: move DSA notes to org/study_deck_02/ Restructure NeetCode study materials into a dedicated Anki-exportable deck directory. Separates DSA problem notes from C++ flashcards. - Move roadmap.org from leetcode/out/ to org/study_deck_02/ - Move 200 note files from org/cpp/dsa/ to org/study_deck_02/dsa/ - Add #+PROPERTY: STUDY_DECK_02 to all org files for org-anki export - Simplify roadmap format: properties drawer replaces nested headings - Update NEETCODE backlinks in all note files - Update extract.mjs and scaffold-notes.mjs for new paths - Create org/study_deck_02/AGENTS.md with study workflow docs - Update root and leetcode AGENTS.md	2026-06-01 16:12:21 +08:00
tomatocream	1d88296bf6	Expand progress cookies (org-mode auto-update)	2026-06-01 02:41:53 +08:00
tomatocream	956c2b2c88	Add TODO checkboxes to Python/C++ sub-headings - roadmap.org: * TODO Python and * TODO C++ with [/] cookie on each problem heading for [0/2] progress tracking - Note files now have TODO Approach, TODO Python, TODO C++ sections for structured problem solving	2026-06-01 02:39:53 +08:00
tomatocream	eabb433ec6	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	2026-06-01 02:33:30 +08:00
tomatocream	7371b2617d	Convert roadmap.org problems from list items to subheadings Problems are now ** TODO headings with proper org tags (:easy:, :medium:, :hard:) instead of checkbox list items. This enables org-mode filtering by difficulty, proper subtree folding, and automatic cookie updates on toggle.	2026-06-01 02:22:17 +08:00