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

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

@@ -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

org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org

@@ -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

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).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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