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/1-d-dynamic-programming/0005-longest-palindromic-substring.org

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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