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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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