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/graphs/0127-word-ladder.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0127. Word Ladder][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/graphs/0130-surrounded-regions.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0130. Surrounded Regions][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/graphs/0133-clone-graph.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0133. Clone Graph][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/graphs/0200-number-of-islands.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0200. Number of Islands][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/graphs/0207-course-schedule.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0207. Course Schedule][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/graphs/0210-course-schedule-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0210. Course Schedule 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/graphs/0261-graph-valid-tree.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0261. Graph Valid Tree][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/graphs/0286-walls-and-gates.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0286. Walls And Gates][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/graphs/0323-number-of-connected-components-in-an-undirected-graph.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0323. Number of Connected Components In An Undirected Graph][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/graphs/0417-pacific-atlantic-water-flow.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0417. Pacific Atlantic Water Flow][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/graphs/0684-redundant-connection.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0684. Redundant Connection][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/graphs/0695-max-area-of-island.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0695. Max Area of Island][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/graphs/0802-find-eventual-safe-states.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0802. Find Eventual Safe States][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/graphs/0994-rotting-oranges.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0994. Rotting Oranges][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/graphs/1905-count-sub-islands.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1905. Count Sub Islands][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/graphs/2092-find-all-people-with-secret.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2092. Find All People With Secret][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/graphs/2658-maximum-number-of-fish-in-a-grid.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2658. Maximum Number of Fish 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

org/cpp/dsa/graphs/2924-find-champion-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2924. Find Champion II][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src