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

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0139-word-break.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org

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

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

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org

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

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/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/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org

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

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

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

org/cpp/dsa/arrays-hashing/0001-two-sum.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0001. Two 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/arrays-hashing/0036-valid-sudoku.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0036. Valid Sudoku][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/arrays-hashing/0049-group-anagrams.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0049. Group Anagrams][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/arrays-hashing/0128-longest-consecutive-sequence.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0128. Longest Consecutive Sequence][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/arrays-hashing/0217-contains-duplicate.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0217. Contains Duplicate][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/arrays-hashing/0238-product-of-array-except-self.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0238. Product of Array Except Self][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/arrays-hashing/0242-valid-anagram.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0242. Valid Anagram][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/arrays-hashing/0271-encode-and-decode-strings.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0271. Encode and Decode Strings][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/arrays-hashing/0347-top-k-frequent-elements.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0347. Top K Frequent Elements][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/arrays-hashing/1408-string-matching-in-an-array.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1408. String Matching in an Array][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/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][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/arrays-hashing/2678-number-of-senior-citizens.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2678. Number of Senior Citizens][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/backtracking/0017-letter-combinations-of-a-phone-number.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0017. Letter Combinations of a Phone Number][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/backtracking/0022-generate-parentheses.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0022. Generate Parentheses][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/backtracking/0039-combination-sum.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0039. Combination 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/backtracking/0040-combination-sum-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0040. Combination Sum 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/backtracking/0046-permutations.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0046. Permutations][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/backtracking/0051-n-queens.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0051. N Queens][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/backtracking/0052-n-queens-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0052. N Queens 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/backtracking/0077-combinations.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0077. Combinations][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/backtracking/0078-subsets.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0078. Subsets][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/backtracking/0079-word-search.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0079. Word Search][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/backtracking/0090-subsets-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0090. Subsets 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/backtracking/0131-palindrome-partitioning.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0131. Palindrome Partitioning][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/backtracking/0351-android-unlock-patterns.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0351. Android Unlock Patterns][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/backtracking/1079-letter-tile-possibilities.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1079. Letter Tile Possibilities][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/backtracking/1863-sum-of-all-subsets-xor-total.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1863. Sum of All Subsets XOR Total][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/binary-search/0004-median-of-two-sorted-arrays.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0004. Median of Two Sorted Arrays][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/binary-search/0033-search-in-rotated-sorted-array.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0033. Search In Rotated Sorted Array][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/binary-search/0074-search-a-2d-matrix.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0074. Search a 2D 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/binary-search/0153-find-minimum-in-rotated-sorted-array.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0153. Find Minimum In Rotated Sorted Array][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/binary-search/0704-binary-search.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0704. Binary Search][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/binary-search/0719-find-k-th-smallest-pair-distance.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0719. Find K-th Smallest Pair 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/binary-search/0875-koko-eating-bananas.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0875. Koko Eating Bananas][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/binary-search/0981-time-based-key-value-store.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0981. Time Based Key Value Store][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/binary-search/2300-successful-pairs-of-spells-and-potions.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2300. Successful Pairs of Spells and Potions][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/bit-manipulation/0007-reverse-integer.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0007. Reverse Integer][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/bit-manipulation/0136-single-number.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0136. Single Number][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/bit-manipulation/0190-reverse-bits.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0190. Reverse Bits][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/bit-manipulation/0191-number-of-1-bits.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0191. Number of 1 Bits][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/bit-manipulation/0231-power-of-two.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0231. Power of Two][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/bit-manipulation/0260-single-number-iii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0260. Single Number III][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/bit-manipulation/0268-missing-number.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0268. Missing Number][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/bit-manipulation/0338-counting-bits.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0338. Counting Bits][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/bit-manipulation/0371-sum-of-two-integers.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0371. Sum of Two Integers][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/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2220. Minimum Bit Flips to Convert Number][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/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

org/cpp/dsa/greedy/0045-jump-game-ii.org

@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0045. Jump Game 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/greedy/0053-maximum-subarray.org

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