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

org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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