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/advanced-graphs/0269-alien-dictionary.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0269. Alien Dictionary][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/advanced-graphs/0332-reconstruct-itinerary.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0332. Reconstruct Itinerary][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/advanced-graphs/0743-network-delay-time.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0743. Network Delay Time][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/advanced-graphs/0778-swim-in-rising-water.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0778. Swim In Rising Water][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/advanced-graphs/0787-cheapest-flights-within-k-stops.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0787. Cheapest Flights Within K Stops][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/advanced-graphs/1584-min-cost-to-connect-all-points.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1584. Min Cost to Connect All Points][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/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][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/advanced-graphs/2812-find-the-safest-path-in-a-grid.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src