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/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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