From 956c2b2c88ca212bea0f33c8029f478e09a7aed6 Mon Sep 17 00:00:00 2001
From: Wong Ding Feng <dingfengwong@gmail.com>
Date: Mon, 1 Jun 2026 02:39:53 +0800
Subject: [PATCH] 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
---
 leetcode/extract.mjs                          |    6 +-
 leetcode/out/roadmap.org                      | 1194 ++++++++---------
 leetcode/scaffold-notes.mjs                   |   11 +-
 .../0005-longest-palindromic-substring.org    |    9 +
 .../0070-climbing-stairs.org                  |    9 +
 .../0091-decode-ways.org                      |    9 +
 .../0139-word-break.org                       |    9 +
 .../0152-maximum-product-subarray.org         |    9 +
 .../0198-house-robber.org                     |    9 +
 .../0213-house-robber-ii.org                  |    9 +
 .../0300-longest-increasing-subsequence.org   |    9 +
 .../0322-coin-change.org                      |    9 +
 .../0416-partition-equal-subset-sum.org       |    9 +
 .../0647-palindromic-substrings.org           |    9 +
 .../0656-coin-path.org                        |    9 +
 .../0746-min-cost-climbing-stairs.org         |    9 +
 .../0010-regular-expression-matching.org      |    9 +
 .../0062-unique-paths.org                     |    9 +
 .../0072-edit-distance.org                    |    9 +
 .../0097-interleaving-string.org              |    9 +
 .../0115-distinct-subsequences.org            |    9 +
 ...me-to-buy-and-sell-stock-with-cooldown.org |    9 +
 .../0312-burst-balloons.org                   |    9 +
 ...29-longest-increasing-path-in-a-matrix.org |    9 +
 .../0494-target-sum.org                       |    9 +
 .../0518-coin-change-ii.org                   |    9 +
 .../1143-longest-common-subsequence.org       |    9 +
 .../1220-count-vowels-permutation.org         |    9 +
 ...11-maximum-alternating-subsequence-sum.org |    9 +
 .../advanced-graphs/0269-alien-dictionary.org |    9 +
 .../0332-reconstruct-itinerary.org            |    9 +
 .../0743-network-delay-time.org               |    9 +
 .../0778-swim-in-rising-water.org             |    9 +
 .../0787-cheapest-flights-within-k-stops.org  |    9 +
 .../1584-min-cost-to-connect-all-points.org   |    9 +
 ...odes-into-the-maximum-number-of-groups.org |    9 +
 .../2812-find-the-safest-path-in-a-grid.org   |    9 +
 org/cpp/dsa/arrays-hashing/0001-two-sum.org   |    9 +
 .../dsa/arrays-hashing/0036-valid-sudoku.org  |    9 +
 .../arrays-hashing/0049-group-anagrams.org    |    9 +
 .../0128-longest-consecutive-sequence.org     |    9 +
 .../0217-contains-duplicate.org               |    9 +
 .../0238-product-of-array-except-self.org     |    9 +
 .../dsa/arrays-hashing/0242-valid-anagram.org |    9 +
 .../0271-encode-and-decode-strings.org        |    9 +
 .../0347-top-k-frequent-elements.org          |    9 +
 .../1408-string-matching-in-an-array.org      |    9 +
 ...erations-to-move-all-balls-to-each-box.org |    9 +
 .../2678-number-of-senior-citizens.org        |    9 +
 ...-letter-combinations-of-a-phone-number.org |    9 +
 .../0022-generate-parentheses.org             |    9 +
 .../dsa/backtracking/0039-combination-sum.org |    9 +
 .../backtracking/0040-combination-sum-ii.org  |    9 +
 .../dsa/backtracking/0046-permutations.org    |    9 +
 org/cpp/dsa/backtracking/0051-n-queens.org    |    9 +
 org/cpp/dsa/backtracking/0052-n-queens-ii.org |    9 +
 .../dsa/backtracking/0077-combinations.org    |    9 +
 org/cpp/dsa/backtracking/0078-subsets.org     |    9 +
 org/cpp/dsa/backtracking/0079-word-search.org |    9 +
 org/cpp/dsa/backtracking/0090-subsets-ii.org  |    9 +
 .../0131-palindrome-partitioning.org          |    9 +
 .../0351-android-unlock-patterns.org          |    9 +
 .../1079-letter-tile-possibilities.org        |    9 +
 .../1863-sum-of-all-subsets-xor-total.org     |    9 +
 .../0004-median-of-two-sorted-arrays.org      |    9 +
 .../0033-search-in-rotated-sorted-array.org   |    9 +
 .../binary-search/0074-search-a-2d-matrix.org |    9 +
 ...3-find-minimum-in-rotated-sorted-array.org |    9 +
 .../dsa/binary-search/0704-binary-search.org  |    9 +
 .../0719-find-k-th-smallest-pair-distance.org |    9 +
 .../0875-koko-eating-bananas.org              |    9 +
 .../0981-time-based-key-value-store.org       |    9 +
 ...successful-pairs-of-spells-and-potions.org |    9 +
 .../bit-manipulation/0007-reverse-integer.org |    9 +
 .../bit-manipulation/0136-single-number.org   |    9 +
 .../bit-manipulation/0190-reverse-bits.org    |    9 +
 .../0191-number-of-1-bits.org                 |    9 +
 .../bit-manipulation/0231-power-of-two.org    |    9 +
 .../0260-single-number-iii.org                |    9 +
 .../bit-manipulation/0268-missing-number.org  |    9 +
 .../bit-manipulation/0338-counting-bits.org   |    9 +
 .../0371-sum-of-two-integers.org              |    9 +
 ...20-minimum-bit-flips-to-convert-number.org |    9 +
 org/cpp/dsa/graphs/0127-word-ladder.org       |    9 +
 .../dsa/graphs/0130-surrounded-regions.org    |    9 +
 org/cpp/dsa/graphs/0133-clone-graph.org       |    9 +
 org/cpp/dsa/graphs/0200-number-of-islands.org |    9 +
 org/cpp/dsa/graphs/0207-course-schedule.org   |    9 +
 .../dsa/graphs/0210-course-schedule-ii.org    |    9 +
 org/cpp/dsa/graphs/0261-graph-valid-tree.org  |    9 +
 org/cpp/dsa/graphs/0286-walls-and-gates.org   |    9 +
 ...cted-components-in-an-undirected-graph.org |    9 +
 .../0417-pacific-atlantic-water-flow.org      |    9 +
 .../dsa/graphs/0684-redundant-connection.org  |    9 +
 .../dsa/graphs/0695-max-area-of-island.org    |    9 +
 .../graphs/0802-find-eventual-safe-states.org |    9 +
 org/cpp/dsa/graphs/0994-rotting-oranges.org   |    9 +
 org/cpp/dsa/graphs/1905-count-sub-islands.org |    9 +
 .../2092-find-all-people-with-secret.org      |    9 +
 .../2658-maximum-number-of-fish-in-a-grid.org |    9 +
 org/cpp/dsa/graphs/2924-find-champion-ii.org  |    9 +
 org/cpp/dsa/greedy/0045-jump-game-ii.org      |    9 +
 org/cpp/dsa/greedy/0053-maximum-subarray.org  |    9 +
 org/cpp/dsa/greedy/0055-jump-game.org         |    9 +
 org/cpp/dsa/greedy/0134-gas-station.org       |    9 +
 .../greedy/0678-valid-parenthesis-string.org  |    9 +
 org/cpp/dsa/greedy/0763-partition-labels.org  |    9 +
 org/cpp/dsa/greedy/0846-hand-of-straights.org |    9 +
 ...minimum-increment-to-make-array-unique.org |    9 +
 .../0978-longest-turbulent-subarray.org       |    9 +
 org/cpp/dsa/greedy/1871-jump-game-vii.org     |    9 +
 ...-merge-triplets-to-form-target-triplet.org |    9 +
 .../0215-kth-largest-element-in-an-array.org  |    9 +
 .../0295-find-median-from-data-stream.org     |    9 +
 .../0355-design-twitter.org                   |    9 +
 .../0621-task-scheduler.org                   |    9 +
 .../0703-kth-largest-element-in-a-stream.org  |    9 +
 .../0973-k-closest-points-to-origin.org       |    9 +
 .../1046-last-stone-weight.org                |    9 +
 .../dsa/intervals/0056-merge-intervals.org    |    9 +
 .../dsa/intervals/0057-insert-interval.org    |    9 +
 org/cpp/dsa/intervals/0252-meeting-rooms.org  |    9 +
 .../dsa/intervals/0253-meeting-rooms-ii.org   |    9 +
 .../0435-non-overlapping-intervals.org        |    9 +
 .../0986-interval-list-intersections.org      |    9 +
 ...minimum-interval-to-include-each-query.org |    9 +
 .../dsa/linked-list/0002-add-two-numbers.org  |    9 +
 .../0019-remove-nth-node-from-end-of-list.org |    9 +
 .../0021-merge-two-sorted-lists.org           |    9 +
 .../linked-list/0023-merge-k-sorted-lists.org |    9 +
 .../0025-reverse-nodes-in-k-group.org         |    9 +
 .../0138-copy-list-with-random-pointer.org    |    9 +
 .../linked-list/0141-linked-list-cycle.org    |    9 +
 org/cpp/dsa/linked-list/0143-reorder-list.org |    9 +
 org/cpp/dsa/linked-list/0146-lru-cache.org    |    9 +
 .../linked-list/0206-reverse-linked-list.org  |    9 +
 .../0287-find-the-duplicate-number.org        |    9 +
 .../0725-split-linked-list-in-parts.org       |    9 +
 .../1472-design-browser-history.org           |    9 +
 .../1721-swapping-nodes-in-a-linked-list.org  |    9 +
 .../2487-remove-nodes-from-linked-list.org    |    9 +
 .../math-geometry/0009-palindrome-number.org  |    9 +
 .../math-geometry/0012-integer-to-roman.org   |    9 +
 .../math-geometry/0043-multiply-strings.org   |    9 +
 .../dsa/math-geometry/0048-rotate-image.org   |    9 +
 org/cpp/dsa/math-geometry/0050-pow-x-n.org    |    9 +
 .../dsa/math-geometry/0054-spiral-matrix.org  |    9 +
 org/cpp/dsa/math-geometry/0066-plus-one.org   |    9 +
 .../math-geometry/0073-set-matrix-zeroes.org  |    9 +
 .../dsa/math-geometry/0202-happy-number.org   |    9 +
 .../math-geometry/0296-best-meeting-point.org |    9 +
 .../0840-magic-squares-in-grid.org            |    9 +
 ...-if-number-is-a-sum-of-powers-of-three.org |    9 +
 .../dsa/math-geometry/2013-detect-squares.org |    9 +
 .../math-geometry/2326-spiral-matrix-iv.org   |    9 +
 ...nd-the-punishment-number-of-an-integer.org |    9 +
 ...substring-without-repeating-characters.org |    9 +
 .../0076-minimum-window-substring.org         |    9 +
 .../0121-best-time-to-buy-and-sell-stock.org  |    9 +
 .../0239-sliding-window-maximum.org           |    9 +
 ...ongest-repeating-character-replacement.org |    9 +
 .../0567-permutation-in-string.org            |    9 +
 ...aining-every-vowel-and-k-consonants-ii.org |    9 +
 org/cpp/dsa/stack/0020-valid-parentheses.org  |    9 +
 .../0084-largest-rectangle-in-histogram.org   |    9 +
 .../0150-evaluate-reverse-polish-notation.org |    9 +
 org/cpp/dsa/stack/0155-min-stack.org          |    9 +
 org/cpp/dsa/stack/0682-baseball-game.org      |    9 +
 org/cpp/dsa/stack/0726-number-of-atoms.org    |    9 +
 org/cpp/dsa/stack/0739-daily-temperatures.org |    9 +
 org/cpp/dsa/stack/0853-car-fleet.org          |    9 +
 org/cpp/dsa/stack/0901-online-stock-span.org  |    9 +
 .../dsa/stack/1544-make-the-string-great.org  |    9 +
 .../0098-validate-binary-search-tree.org      |    9 +
 org/cpp/dsa/trees/0100-same-tree.org          |    9 +
 ...0102-binary-tree-level-order-traversal.org |    9 +
 .../0104-maximum-depth-of-binary-tree.org     |    9 +
 ...ee-from-preorder-and-inorder-traversal.org |    9 +
 .../dsa/trees/0110-balanced-binary-tree.org   |    9 +
 .../0124-binary-tree-maximum-path-sum.org     |    9 +
 .../0199-binary-tree-right-side-view.org      |    9 +
 org/cpp/dsa/trees/0226-invert-binary-tree.org |    9 +
 .../0230-kth-smallest-element-in-a-bst.org    |    9 +
 ...ommon-ancestor-of-a-binary-search-tree.org |    9 +
 ...-serialize-and-deserialize-binary-tree.org |    9 +
 .../trees/0543-diameter-of-binary-tree.org    |    9 +
 .../trees/0572-subtree-of-another-tree.org    |    9 +
 .../0590-n-ary-tree-postorder-traversal.org   |    9 +
 ...recover-a-tree-from-preorder-traversal.org |    9 +
 ...76-time-needed-to-inform-all-employees.org |    9 +
 .../1448-count-good-nodes-in-binary-tree.org  |    9 +
 .../tries/0208-implement-trie-prefix-tree.org |    9 +
 ...gn-add-and-search-words-data-structure.org |    9 +
 org/cpp/dsa/tries/0212-word-search-ii.org     |    9 +
 org/cpp/dsa/tries/1166-design-file-system.org |    9 +
 .../0011-container-with-most-water.org        |    9 +
 org/cpp/dsa/two-pointers/0015-3sum.org        |    9 +
 .../two-pointers/0042-trapping-rain-water.org |    9 +
 .../two-pointers/0125-valid-palindrome.org    |    9 +
 .../0167-two-sum-ii-input-array-is-sorted.org |    9 +
 .../dsa/two-pointers/0259-3sum-smaller.org    |    9 +
 .../dsa/two-pointers/0344-reverse-string.org  |    9 +
 202 files changed, 2401 insertions(+), 601 deletions(-)

diff --git a/leetcode/extract.mjs b/leetcode/extract.mjs
index e031962..dd0108f 100644
--- a/leetcode/extract.mjs
+++ b/leetcode/extract.mjs
@@ -234,10 +234,10 @@ function buildOrg(sortedNodes, problemsByTopic) {
       const lcUrl = `${LEETCODE_BASE}${p.link}`;
       const num = p.code.split("-")[0];
       const notesFile = `${notesRoot}/${slug}/${p.code}.org`;
-      lines.push(`** TODO ${num}. ${p.name} :${tag}:`);
-      lines.push(`*** Python`);
+      lines.push(`** TODO ${num}. ${p.name} :${tag}: [/]`);
+      lines.push(`*** TODO Python`);
       lines.push(`- [[${GITHUB_SOLUTIONS}python/${p.code}.py][${p.code}.py]]`);
-      lines.push(`*** C++`);
+      lines.push(`*** TODO C++`);
       lines.push(`- [[${GITHUB_SOLUTIONS}cpp/${p.code}.cpp][${p.code}.cpp]]`);
       lines.push(`- LeetCode: [[${lcUrl}][${p.link}]]`);
       if (p.video)
diff --git a/leetcode/out/roadmap.org b/leetcode/out/roadmap.org
index f93078d..7fa5b34 100644
--- a/leetcode/out/roadmap.org
+++ b/leetcode/out/roadmap.org
@@ -7,98 +7,98 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Arrays & Hashing [/]
 
-** TODO 0217. Contains Duplicate :easy:
-*** Python
+** TODO 0217. Contains Duplicate :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0217-contains-duplicate.py][0217-contains-duplicate.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0217-contains-duplicate.cpp][0217-contains-duplicate.cpp]]
 - LeetCode: [[https://leetcode.com/problems/contains-duplicate/][contains-duplicate/]]
 - Video: [[https://youtube.com/watch?v=3OamzN90kPg][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org][My Solution]]
-** TODO 0242. Valid Anagram :easy:
-*** Python
+** TODO 0242. Valid Anagram :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0242-valid-anagram.py][0242-valid-anagram.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][0242-valid-anagram.cpp]]
 - LeetCode: [[https://leetcode.com/problems/valid-anagram/][valid-anagram/]]
 - Video: [[https://youtube.com/watch?v=9UtInBqnCgA][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0242-valid-anagram.org][My Solution]]
-** TODO 2678. Number of Senior Citizens :easy:
-*** Python
+** TODO 2678. Number of Senior Citizens :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2678-number-of-senior-citizens.py][2678-number-of-senior-citizens.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2678-number-of-senior-citizens.cpp][2678-number-of-senior-citizens.cpp]]
 - LeetCode: [[https://leetcode.com/problems/number-of-senior-citizens/][number-of-senior-citizens/]]
 - Video: [[https://youtube.com/watch?v=l6_wwKzFmVo][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org][My Solution]]
-** TODO 0001. Two Sum :easy:
-*** Python
+** TODO 0001. Two Sum :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0001-two-sum.py][0001-two-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0001-two-sum.cpp][0001-two-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/two-sum/][two-sum/]]
 - Video: [[https://youtube.com/watch?v=KLlXCFG5TnA][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0001-two-sum.org][My Solution]]
-** TODO 1408. String Matching in an Array :easy:
-*** Python
+** TODO 1408. String Matching in an Array :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1408-string-matching-in-an-array.py][1408-string-matching-in-an-array.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1408-string-matching-in-an-array.cpp][1408-string-matching-in-an-array.cpp]]
 - LeetCode: [[https://leetcode.com/problems/string-matching-in-an-array/][string-matching-in-an-array/]]
 - Video: [[https://youtube.com/watch?v=7K2BjgjCFDo][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org][My Solution]]
-** TODO 0049. Group Anagrams :medium:
-*** Python
+** TODO 0049. Group Anagrams :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0049-group-anagrams.py][0049-group-anagrams.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0049-group-anagrams.cpp][0049-group-anagrams.cpp]]
 - LeetCode: [[https://leetcode.com/problems/group-anagrams/][group-anagrams/]]
 - Video: [[https://youtube.com/watch?v=vzdNOK2oB2E][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0049-group-anagrams.org][My Solution]]
-** TODO 0347. Top K Frequent Elements :medium:
-*** Python
+** TODO 0347. Top K Frequent Elements :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0347-top-k-frequent-elements.py][0347-top-k-frequent-elements.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0347-top-k-frequent-elements.cpp][0347-top-k-frequent-elements.cpp]]
 - LeetCode: [[https://leetcode.com/problems/top-k-frequent-elements/][top-k-frequent-elements/]]
 - Video: [[https://youtube.com/watch?v=YPTqKIgVk-k][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org][My Solution]]
-** TODO 0271. Encode and Decode Strings :medium:
-*** Python
+** TODO 0271. Encode and Decode Strings :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0271-encode-and-decode-strings.py][0271-encode-and-decode-strings.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0271-encode-and-decode-strings.cpp][0271-encode-and-decode-strings.cpp]]
 - LeetCode: [[https://leetcode.com/problems/encode-and-decode-strings/][encode-and-decode-strings/]]
 - Video: [[https://youtube.com/watch?v=B1k_sxOSgv8][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org][My Solution]]
-** TODO 0238. Product of Array Except Self :medium:
-*** Python
+** TODO 0238. Product of Array Except Self :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0238-product-of-array-except-self.py][0238-product-of-array-except-self.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0238-product-of-array-except-self.cpp][0238-product-of-array-except-self.cpp]]
 - LeetCode: [[https://leetcode.com/problems/product-of-array-except-self/][product-of-array-except-self/]]
 - Video: [[https://youtube.com/watch?v=bNvIQI2wAjk][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org][My Solution]]
-** TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
-*** Python
+** TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp][1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp]]
 - LeetCode: [[https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/][minimum-number-of-operations-to-move-all-balls-to-each-box/]]
 - Video: [[https://youtube.com/watch?v=ZmH3gHiIqfI][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org][My Solution]]
-** TODO 0036. Valid Sudoku :medium:
-*** Python
+** TODO 0036. Valid Sudoku :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0036-valid-sudoku.py][0036-valid-sudoku.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0036-valid-sudoku.cpp][0036-valid-sudoku.cpp]]
 - LeetCode: [[https://leetcode.com/problems/valid-sudoku/][valid-sudoku/]]
 - Video: [[https://youtube.com/watch?v=TjFXEUCMqI8][explanation]]
 - Notes: [[../../org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org][My Solution]]
-** TODO 0128. Longest Consecutive Sequence :medium:
-*** Python
+** TODO 0128. Longest Consecutive Sequence :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0128-longest-consecutive-sequence.py][0128-longest-consecutive-sequence.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0128-longest-consecutive-sequence.cpp][0128-longest-consecutive-sequence.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-consecutive-sequence/][longest-consecutive-sequence/]]
 - Video: [[https://youtube.com/watch?v=P6RZZMu_maU][explanation]]
@@ -106,57 +106,57 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Two Pointers [/]
 
-** TODO 0344. Reverse String :easy:
-*** Python
+** TODO 0344. Reverse String :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0344-reverse-string.py][0344-reverse-string.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0344-reverse-string.cpp][0344-reverse-string.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reverse-string/][reverse-string/]]
 - Video: [[https://youtube.com/watch?v=_d0T_2Lk2qA][explanation]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0344-reverse-string.org][My Solution]]
-** TODO 0125. Valid Palindrome :easy:
-*** Python
+** TODO 0125. Valid Palindrome :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0125-valid-palindrome.py][0125-valid-palindrome.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0125-valid-palindrome.cpp][0125-valid-palindrome.cpp]]
 - LeetCode: [[https://leetcode.com/problems/valid-palindrome/][valid-palindrome/]]
 - Video: [[https://youtube.com/watch?v=jJXJ16kPFWg][explanation]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0125-valid-palindrome.org][My Solution]]
-** TODO 0167. Two Sum II Input Array Is Sorted :medium:
-*** Python
+** TODO 0167. Two Sum II Input Array Is Sorted :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0167-two-sum-ii-input-array-is-sorted.py][0167-two-sum-ii-input-array-is-sorted.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0167-two-sum-ii-input-array-is-sorted.cpp][0167-two-sum-ii-input-array-is-sorted.cpp]]
 - LeetCode: [[https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/][two-sum-ii-input-array-is-sorted/]]
 - Video: [[https://youtube.com/watch?v=cQ1Oz4ckceM][explanation]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org][My Solution]]
-** TODO 0015. 3Sum :medium:
-*** Python
+** TODO 0015. 3Sum :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0015-3sum.py][0015-3sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0015-3sum.cpp][0015-3sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/3sum/][3sum/]]
 - Video: [[https://youtube.com/watch?v=jzZsG8n2R9A][explanation]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0015-3sum.org][My Solution]]
-** TODO 0011. Container With Most Water :medium:
-*** Python
+** TODO 0011. Container With Most Water :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0011-container-with-most-water.py][0011-container-with-most-water.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0011-container-with-most-water.cpp][0011-container-with-most-water.cpp]]
 - LeetCode: [[https://leetcode.com/problems/container-with-most-water/][container-with-most-water/]]
 - Video: [[https://youtube.com/watch?v=UuiTKBwPgAo][explanation]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0011-container-with-most-water.org][My Solution]]
-** TODO 0259. 3Sum Smaller :medium:
-*** Python
+** TODO 0259. 3Sum Smaller :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0259-3sum-smaller.py][0259-3sum-smaller.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0259-3sum-smaller.cpp][0259-3sum-smaller.cpp]]
 - LeetCode: [[https://leetcode.com/problems/3sum-smaller/][3sum-smaller/]]
 - Notes: [[../../org/cpp/dsa/two-pointers/0259-3sum-smaller.org][My Solution]]
-** TODO 0042. Trapping Rain Water :hard:
-*** Python
+** TODO 0042. Trapping Rain Water :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0042-trapping-rain-water.py][0042-trapping-rain-water.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0042-trapping-rain-water.cpp][0042-trapping-rain-water.cpp]]
 - LeetCode: [[https://leetcode.com/problems/trapping-rain-water/][trapping-rain-water/]]
 - Video: [[https://youtube.com/watch?v=ZI2z5pq0TqA][explanation]]
@@ -164,74 +164,74 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Binary Search [/]
 
-** TODO 0704. Binary Search :easy:
-*** Python
+** TODO 0704. Binary Search :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0704-binary-search.py][0704-binary-search.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0704-binary-search.cpp][0704-binary-search.cpp]]
 - LeetCode: [[https://leetcode.com/problems/binary-search/][binary-search/]]
 - Video: [[https://youtube.com/watch?v=s4DPM8ct1pI][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0704-binary-search.org][My Solution]]
-** TODO 2300. Successful Pairs of Spells and Potions :medium:
-*** Python
+** TODO 2300. Successful Pairs of Spells and Potions :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2300-successful-pairs-of-spells-and-potions.py][2300-successful-pairs-of-spells-and-potions.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2300-successful-pairs-of-spells-and-potions.cpp][2300-successful-pairs-of-spells-and-potions.cpp]]
 - LeetCode: [[https://leetcode.com/problems/successful-pairs-of-spells-and-potions/][successful-pairs-of-spells-and-potions/]]
 - Video: [[https://youtube.com/watch?v=OKnm5oyAhWg][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org][My Solution]]
-** TODO 0074. Search a 2D Matrix :medium:
-*** Python
+** TODO 0074. Search a 2D Matrix :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0074-search-a-2d-matrix.py][0074-search-a-2d-matrix.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0074-search-a-2d-matrix.cpp][0074-search-a-2d-matrix.cpp]]
 - LeetCode: [[https://leetcode.com/problems/search-a-2d-matrix/][search-a-2d-matrix/]]
 - Video: [[https://youtube.com/watch?v=Ber2pi2C0j0][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org][My Solution]]
-** TODO 0875. Koko Eating Bananas :medium:
-*** Python
+** TODO 0875. Koko Eating Bananas :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0875-koko-eating-bananas.py][0875-koko-eating-bananas.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0875-koko-eating-bananas.cpp][0875-koko-eating-bananas.cpp]]
 - LeetCode: [[https://leetcode.com/problems/koko-eating-bananas/][koko-eating-bananas/]]
 - Video: [[https://youtube.com/watch?v=U2SozAs9RzA][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0875-koko-eating-bananas.org][My Solution]]
-** TODO 0153. Find Minimum In Rotated Sorted Array :medium:
-*** Python
+** TODO 0153. Find Minimum In Rotated Sorted Array :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0153-find-minimum-in-rotated-sorted-array.py][0153-find-minimum-in-rotated-sorted-array.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0153-find-minimum-in-rotated-sorted-array.cpp][0153-find-minimum-in-rotated-sorted-array.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/][find-minimum-in-rotated-sorted-array/]]
 - Video: [[https://youtube.com/watch?v=nIVW4P8b1VA][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org][My Solution]]
-** TODO 0033. Search In Rotated Sorted Array :medium:
-*** Python
+** TODO 0033. Search In Rotated Sorted Array :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0033-search-in-rotated-sorted-array.py][0033-search-in-rotated-sorted-array.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0033-search-in-rotated-sorted-array.cpp][0033-search-in-rotated-sorted-array.cpp]]
 - LeetCode: [[https://leetcode.com/problems/search-in-rotated-sorted-array/][search-in-rotated-sorted-array/]]
 - Video: [[https://youtube.com/watch?v=U8XENwh8Oy8][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org][My Solution]]
-** TODO 0981. Time Based Key Value Store :medium:
-*** Python
+** TODO 0981. Time Based Key Value Store :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0981-time-based-key-value-store.py][0981-time-based-key-value-store.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0981-time-based-key-value-store.cpp][0981-time-based-key-value-store.cpp]]
 - LeetCode: [[https://leetcode.com/problems/time-based-key-value-store/][time-based-key-value-store/]]
 - Video: [[https://youtube.com/watch?v=fu2cD_6E8Hw][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0981-time-based-key-value-store.org][My Solution]]
-** TODO 0719. Find K-th Smallest Pair Distance :hard:
-*** Python
+** TODO 0719. Find K-th Smallest Pair Distance :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0719-find-k-th-smallest-pair-distance.py][0719-find-k-th-smallest-pair-distance.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0719-find-k-th-smallest-pair-distance.cpp][0719-find-k-th-smallest-pair-distance.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-k-th-smallest-pair-distance/][find-k-th-smallest-pair-distance/]]
 - Video: [[https://youtube.com/watch?v=bQ-QcFKwsZc][explanation]]
 - Notes: [[../../org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org][My Solution]]
-** TODO 0004. Median of Two Sorted Arrays :hard:
-*** Python
+** TODO 0004. Median of Two Sorted Arrays :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0004-median-of-two-sorted-arrays.py][0004-median-of-two-sorted-arrays.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0004-median-of-two-sorted-arrays.cpp][0004-median-of-two-sorted-arrays.cpp]]
 - LeetCode: [[https://leetcode.com/problems/median-of-two-sorted-arrays/][median-of-two-sorted-arrays/]]
 - Video: [[https://youtube.com/watch?v=q6IEA26hvXc][explanation]]
@@ -239,82 +239,82 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Stack [/]
 
-** TODO 0682. Baseball Game :easy:
-*** Python
+** TODO 0682. Baseball Game :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0682-baseball-game.py][0682-baseball-game.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0682-baseball-game.cpp][0682-baseball-game.cpp]]
 - LeetCode: [[https://leetcode.com/problems/baseball-game/][baseball-game/]]
 - Video: [[https://youtube.com/watch?v=Id_tqGdsZQI][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0682-baseball-game.org][My Solution]]
-** TODO 0020. Valid Parentheses :easy:
-*** Python
+** TODO 0020. Valid Parentheses :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0020-valid-parentheses.py][0020-valid-parentheses.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0020-valid-parentheses.cpp][0020-valid-parentheses.cpp]]
 - LeetCode: [[https://leetcode.com/problems/valid-parentheses/][valid-parentheses/]]
 - Video: [[https://youtube.com/watch?v=WTzjTskDFMg][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0020-valid-parentheses.org][My Solution]]
-** TODO 1544. Make The String Great :easy:
-*** Python
+** TODO 1544. Make The String Great :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1544-make-the-string-great.py][1544-make-the-string-great.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1544-make-the-string-great.cpp][1544-make-the-string-great.cpp]]
 - LeetCode: [[https://leetcode.com/problems/make-the-string-great/][make-the-string-great/]]
 - Video: [[https://youtube.com/watch?v=10tBWNjzvtw][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/1544-make-the-string-great.org][My Solution]]
-** TODO 0155. Min Stack :medium:
-*** Python
+** TODO 0155. Min Stack :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0155-min-stack.py][0155-min-stack.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0155-min-stack.cpp][0155-min-stack.cpp]]
 - LeetCode: [[https://leetcode.com/problems/min-stack/][min-stack/]]
 - Video: [[https://youtube.com/watch?v=qkLl7nAwDPo][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0155-min-stack.org][My Solution]]
-** TODO 0150. Evaluate Reverse Polish Notation :medium:
-*** Python
+** TODO 0150. Evaluate Reverse Polish Notation :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0150-evaluate-reverse-polish-notation.py][0150-evaluate-reverse-polish-notation.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0150-evaluate-reverse-polish-notation.cpp][0150-evaluate-reverse-polish-notation.cpp]]
 - LeetCode: [[https://leetcode.com/problems/evaluate-reverse-polish-notation/][evaluate-reverse-polish-notation/]]
 - Video: [[https://youtube.com/watch?v=iu0082c4HDE][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org][My Solution]]
-** TODO 0739. Daily Temperatures :medium:
-*** Python
+** TODO 0739. Daily Temperatures :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0739-daily-temperatures.py][0739-daily-temperatures.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0739-daily-temperatures.cpp][0739-daily-temperatures.cpp]]
 - LeetCode: [[https://leetcode.com/problems/daily-temperatures/][daily-temperatures/]]
 - Video: [[https://youtube.com/watch?v=cTBiBSnjO3c][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0739-daily-temperatures.org][My Solution]]
-** TODO 0901. Online Stock Span :medium:
-*** Python
+** TODO 0901. Online Stock Span :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0901-online-stock-span.py][0901-online-stock-span.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0901-online-stock-span.cpp][0901-online-stock-span.cpp]]
 - LeetCode: [[https://leetcode.com/problems/online-stock-span/][online-stock-span/]]
 - Video: [[https://youtube.com/watch?v=slYh0ZNEqSw][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0901-online-stock-span.org][My Solution]]
-** TODO 0853. Car Fleet :medium:
-*** Python
+** TODO 0853. Car Fleet :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0853-car-fleet.py][0853-car-fleet.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0853-car-fleet.cpp][0853-car-fleet.cpp]]
 - LeetCode: [[https://leetcode.com/problems/car-fleet/][car-fleet/]]
 - Video: [[https://youtube.com/watch?v=Pr6T-3yB9RM][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0853-car-fleet.org][My Solution]]
-** TODO 0084. Largest Rectangle In Histogram :hard:
-*** Python
+** TODO 0084. Largest Rectangle In Histogram :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0084-largest-rectangle-in-histogram.py][0084-largest-rectangle-in-histogram.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0084-largest-rectangle-in-histogram.cpp][0084-largest-rectangle-in-histogram.cpp]]
 - LeetCode: [[https://leetcode.com/problems/largest-rectangle-in-histogram/][largest-rectangle-in-histogram/]]
 - Video: [[https://youtube.com/watch?v=zx5Sw9130L0][explanation]]
 - Notes: [[../../org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org][My Solution]]
-** TODO 0726. Number of Atoms :hard:
-*** Python
+** TODO 0726. Number of Atoms :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0726-number-of-atoms.py][0726-number-of-atoms.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0726-number-of-atoms.cpp][0726-number-of-atoms.cpp]]
 - LeetCode: [[https://leetcode.com/problems/number-of-atoms/][number-of-atoms/]]
 - Video: [[https://youtube.com/watch?v=iuK05gGBzJc][explanation]]
@@ -322,58 +322,58 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Sliding Window [/]
 
-** TODO 0121. Best Time to Buy And Sell Stock :easy:
-*** Python
+** TODO 0121. Best Time to Buy And Sell Stock :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0121-best-time-to-buy-and-sell-stock.py][0121-best-time-to-buy-and-sell-stock.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0121-best-time-to-buy-and-sell-stock.cpp][0121-best-time-to-buy-and-sell-stock.cpp]]
 - LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock/][best-time-to-buy-and-sell-stock/]]
 - Video: [[https://youtube.com/watch?v=1pkOgXD63yU][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org][My Solution]]
-** TODO 0003. Longest Substring Without Repeating Characters :medium:
-*** Python
+** TODO 0003. Longest Substring Without Repeating Characters :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0003-longest-substring-without-repeating-characters.py][0003-longest-substring-without-repeating-characters.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0003-longest-substring-without-repeating-characters.cpp][0003-longest-substring-without-repeating-characters.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-substring-without-repeating-characters/][longest-substring-without-repeating-characters/]]
 - Video: [[https://youtube.com/watch?v=wiGpQwVHdE0][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org][My Solution]]
-** TODO 0424. Longest Repeating Character Replacement :medium:
-*** Python
+** TODO 0424. Longest Repeating Character Replacement :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0424-longest-repeating-character-replacement.py][0424-longest-repeating-character-replacement.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0424-longest-repeating-character-replacement.cpp][0424-longest-repeating-character-replacement.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-repeating-character-replacement/][longest-repeating-character-replacement/]]
 - Video: [[https://youtube.com/watch?v=gqXU1UyA8pk][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org][My Solution]]
-** TODO 0567. Permutation In String :medium:
-*** Python
+** TODO 0567. Permutation In String :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0567-permutation-in-string.py][0567-permutation-in-string.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0567-permutation-in-string.cpp][0567-permutation-in-string.cpp]]
 - LeetCode: [[https://leetcode.com/problems/permutation-in-string/][permutation-in-string/]]
 - Video: [[https://youtube.com/watch?v=UbyhOgBN834][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/0567-permutation-in-string.org][My Solution]]
-** TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium:
-*** Python
+** TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp][3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/][count-of-substrings-containing-every-vowel-and-k-consonants-ii/]]
 - Video: [[https://youtube.com/watch?v=2wANakxRZNo][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org][My Solution]]
-** TODO 0076. Minimum Window Substring :hard:
-*** Python
+** TODO 0076. Minimum Window Substring :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0076-minimum-window-substring.py][0076-minimum-window-substring.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0076-minimum-window-substring.cpp][0076-minimum-window-substring.cpp]]
 - LeetCode: [[https://leetcode.com/problems/minimum-window-substring/][minimum-window-substring/]]
 - Video: [[https://youtube.com/watch?v=jSto0O4AJbM][explanation]]
 - Notes: [[../../org/cpp/dsa/sliding-window/0076-minimum-window-substring.org][My Solution]]
-** TODO 0239. Sliding Window Maximum :hard:
-*** Python
+** TODO 0239. Sliding Window Maximum :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0239-sliding-window-maximum.py][0239-sliding-window-maximum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0239-sliding-window-maximum.cpp][0239-sliding-window-maximum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/sliding-window-maximum/][sliding-window-maximum/]]
 - Video: [[https://youtube.com/watch?v=DfljaUwZsOk][explanation]]
@@ -381,122 +381,122 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Linked List [/]
 
-** TODO 0206. Reverse Linked List :easy:
-*** Python
+** TODO 0206. Reverse Linked List :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0206-reverse-linked-list.py][0206-reverse-linked-list.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0206-reverse-linked-list.cpp][0206-reverse-linked-list.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reverse-linked-list/][reverse-linked-list/]]
 - Video: [[https://youtube.com/watch?v=G0_I-ZF0S38][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0206-reverse-linked-list.org][My Solution]]
-** TODO 0021. Merge Two Sorted Lists :easy:
-*** Python
+** TODO 0021. Merge Two Sorted Lists :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0021-merge-two-sorted-lists.py][0021-merge-two-sorted-lists.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0021-merge-two-sorted-lists.cpp][0021-merge-two-sorted-lists.cpp]]
 - LeetCode: [[https://leetcode.com/problems/merge-two-sorted-lists/][merge-two-sorted-lists/]]
 - Video: [[https://youtube.com/watch?v=XIdigk956u0][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org][My Solution]]
-** TODO 0141. Linked List Cycle :easy:
-*** Python
+** TODO 0141. Linked List Cycle :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0141-linked-list-cycle.py][0141-linked-list-cycle.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0141-linked-list-cycle.cpp][0141-linked-list-cycle.cpp]]
 - LeetCode: [[https://leetcode.com/problems/linked-list-cycle/][linked-list-cycle/]]
 - Video: [[https://youtube.com/watch?v=gBTe7lFR3vc][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0141-linked-list-cycle.org][My Solution]]
-** TODO 2487. Remove Nodes From Linked List :medium:
-*** Python
+** TODO 2487. Remove Nodes From Linked List :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2487-remove-nodes-from-linked-list.py][2487-remove-nodes-from-linked-list.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2487-remove-nodes-from-linked-list.cpp][2487-remove-nodes-from-linked-list.cpp]]
 - LeetCode: [[https://leetcode.com/problems/remove-nodes-from-linked-list/][remove-nodes-from-linked-list/]]
 - Video: [[https://youtube.com/watch?v=y783sRTezDg][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org][My Solution]]
-** TODO 0143. Reorder List :medium:
-*** Python
+** TODO 0143. Reorder List :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0143-reorder-list.py][0143-reorder-list.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0143-reorder-list.cpp][0143-reorder-list.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reorder-list/][reorder-list/]]
 - Video: [[https://youtube.com/watch?v=S5bfdUTrKLM][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0143-reorder-list.org][My Solution]]
-** TODO 0019. Remove Nth Node From End of List :medium:
-*** Python
+** TODO 0019. Remove Nth Node From End of List :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0019-remove-nth-node-from-end-of-list.py][0019-remove-nth-node-from-end-of-list.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0019-remove-nth-node-from-end-of-list.cpp][0019-remove-nth-node-from-end-of-list.cpp]]
 - LeetCode: [[https://leetcode.com/problems/remove-nth-node-from-end-of-list/][remove-nth-node-from-end-of-list/]]
 - Video: [[https://youtube.com/watch?v=XVuQxVej6y8][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org][My Solution]]
-** TODO 1721. Swapping Nodes in a Linked List :medium:
-*** Python
+** TODO 1721. Swapping Nodes in a Linked List :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1721-swapping-nodes-in-a-linked-list.py][1721-swapping-nodes-in-a-linked-list.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1721-swapping-nodes-in-a-linked-list.cpp][1721-swapping-nodes-in-a-linked-list.cpp]]
 - LeetCode: [[https://leetcode.com/problems/swapping-nodes-in-a-linked-list/][swapping-nodes-in-a-linked-list/]]
 - Video: [[https://youtube.com/watch?v=4LsrgMyQIjQ][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org][My Solution]]
-** TODO 0138. Copy List With Random Pointer :medium:
-*** Python
+** TODO 0138. Copy List With Random Pointer :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0138-copy-list-with-random-pointer.py][0138-copy-list-with-random-pointer.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0138-copy-list-with-random-pointer.cpp][0138-copy-list-with-random-pointer.cpp]]
 - LeetCode: [[https://leetcode.com/problems/copy-list-with-random-pointer/][copy-list-with-random-pointer/]]
 - Video: [[https://youtube.com/watch?v=5Y2EiZST97Y][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org][My Solution]]
-** TODO 1472. Design Browser History :medium:
-*** Python
+** TODO 1472. Design Browser History :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1472-design-browser-history.py][1472-design-browser-history.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1472-design-browser-history.cpp][1472-design-browser-history.cpp]]
 - LeetCode: [[https://leetcode.com/problems/design-browser-history/][design-browser-history/]]
 - Video: [[https://youtube.com/watch?v=i1G-kKnBu8k][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/1472-design-browser-history.org][My Solution]]
-** TODO 0002. Add Two Numbers :medium:
-*** Python
+** TODO 0002. Add Two Numbers :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0002-add-two-numbers.py][0002-add-two-numbers.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0002-add-two-numbers.cpp][0002-add-two-numbers.cpp]]
 - LeetCode: [[https://leetcode.com/problems/add-two-numbers/][add-two-numbers/]]
 - Video: [[https://youtube.com/watch?v=wgFPrzTjm7s][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0002-add-two-numbers.org][My Solution]]
-** TODO 0287. Find The Duplicate Number :medium:
-*** Python
+** TODO 0287. Find The Duplicate Number :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0287-find-the-duplicate-number.py][0287-find-the-duplicate-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0287-find-the-duplicate-number.cpp][0287-find-the-duplicate-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-the-duplicate-number/][find-the-duplicate-number/]]
 - Video: [[https://youtube.com/watch?v=wjYnzkAhcNk][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org][My Solution]]
-** TODO 0725. Split Linked List in Parts :medium:
-*** Python
+** TODO 0725. Split Linked List in Parts :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0725-split-linked-list-in-parts.py][0725-split-linked-list-in-parts.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0725-split-linked-list-in-parts.cpp][0725-split-linked-list-in-parts.cpp]]
 - LeetCode: [[https://leetcode.com/problems/split-linked-list-in-parts/][split-linked-list-in-parts/]]
 - Video: [[https://youtube.com/watch?v=-OTlqdrxrVI][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org][My Solution]]
-** TODO 0146. LRU Cache :medium:
-*** Python
+** TODO 0146. LRU Cache :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0146-lru-cache.py][0146-lru-cache.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0146-lru-cache.cpp][0146-lru-cache.cpp]]
 - LeetCode: [[https://leetcode.com/problems/lru-cache/][lru-cache/]]
 - Video: [[https://youtube.com/watch?v=7ABFKPK2hD4][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0146-lru-cache.org][My Solution]]
-** TODO 0023. Merge K Sorted Lists :hard:
-*** Python
+** TODO 0023. Merge K Sorted Lists :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0023-merge-k-sorted-lists.py][0023-merge-k-sorted-lists.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0023-merge-k-sorted-lists.cpp][0023-merge-k-sorted-lists.cpp]]
 - LeetCode: [[https://leetcode.com/problems/merge-k-sorted-lists/][merge-k-sorted-lists/]]
 - Video: [[https://youtube.com/watch?v=q5a5OiGbT6Q][explanation]]
 - Notes: [[../../org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org][My Solution]]
-** TODO 0025. Reverse Nodes In K Group :hard:
-*** Python
+** TODO 0025. Reverse Nodes In K Group :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0025-reverse-nodes-in-k-group.py][0025-reverse-nodes-in-k-group.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0025-reverse-nodes-in-k-group.cpp][0025-reverse-nodes-in-k-group.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reverse-nodes-in-k-group/][reverse-nodes-in-k-group/]]
 - Video: [[https://youtube.com/watch?v=1UOPsfP85V4][explanation]]
@@ -504,146 +504,146 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Trees [/]
 
-** TODO 0590. N-ary Tree Postorder Traversal :easy:
-*** Python
+** TODO 0590. N-ary Tree Postorder Traversal :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0590-n-ary-tree-postorder-traversal.py][0590-n-ary-tree-postorder-traversal.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0590-n-ary-tree-postorder-traversal.cpp][0590-n-ary-tree-postorder-traversal.cpp]]
 - LeetCode: [[https://leetcode.com/problems/n-ary-tree-postorder-traversal/][n-ary-tree-postorder-traversal/]]
 - Video: [[https://youtube.com/watch?v=GMUI91_pDmM][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org][My Solution]]
-** TODO 0226. Invert Binary Tree :easy:
-*** Python
+** TODO 0226. Invert Binary Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0226-invert-binary-tree.py][0226-invert-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0226-invert-binary-tree.cpp][0226-invert-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/invert-binary-tree/][invert-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=OnSn2XEQ4MY][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0226-invert-binary-tree.org][My Solution]]
-** TODO 0104. Maximum Depth of Binary Tree :easy:
-*** Python
+** TODO 0104. Maximum Depth of Binary Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0104-maximum-depth-of-binary-tree.py][0104-maximum-depth-of-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0104-maximum-depth-of-binary-tree.cpp][0104-maximum-depth-of-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/maximum-depth-of-binary-tree/][maximum-depth-of-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=hTM3phVI6YQ][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org][My Solution]]
-** TODO 0543. Diameter of Binary Tree :easy:
-*** Python
+** TODO 0543. Diameter of Binary Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0543-diameter-of-binary-tree.py][0543-diameter-of-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0543-diameter-of-binary-tree.cpp][0543-diameter-of-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/diameter-of-binary-tree/][diameter-of-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=K81C31ytOZE][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0543-diameter-of-binary-tree.org][My Solution]]
-** TODO 0110. Balanced Binary Tree :easy:
-*** Python
+** TODO 0110. Balanced Binary Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0110-balanced-binary-tree.py][0110-balanced-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0110-balanced-binary-tree.cpp][0110-balanced-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/balanced-binary-tree/][balanced-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=QfJsau0ItOY][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0110-balanced-binary-tree.org][My Solution]]
-** TODO 0100. Same Tree :easy:
-*** Python
+** TODO 0100. Same Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0100-same-tree.py][0100-same-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0100-same-tree.cpp][0100-same-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/same-tree/][same-tree/]]
 - Video: [[https://youtube.com/watch?v=vRbbcKXCxOw][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0100-same-tree.org][My Solution]]
-** TODO 0572. Subtree of Another Tree :easy:
-*** Python
+** TODO 0572. Subtree of Another Tree :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0572-subtree-of-another-tree.py][0572-subtree-of-another-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0572-subtree-of-another-tree.cpp][0572-subtree-of-another-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/subtree-of-another-tree/][subtree-of-another-tree/]]
 - Video: [[https://youtube.com/watch?v=E36O5SWp-LE][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0572-subtree-of-another-tree.org][My Solution]]
-** TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium:
-*** Python
+** TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0235-lowest-common-ancestor-of-a-binary-search-tree.py][0235-lowest-common-ancestor-of-a-binary-search-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0235-lowest-common-ancestor-of-a-binary-search-tree.cpp][0235-lowest-common-ancestor-of-a-binary-search-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/][lowest-common-ancestor-of-a-binary-search-tree/]]
 - Video: [[https://youtube.com/watch?v=gs2LMfuOR9k][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org][My Solution]]
-** TODO 0102. Binary Tree Level Order Traversal :medium:
-*** Python
+** TODO 0102. Binary Tree Level Order Traversal :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0102-binary-tree-level-order-traversal.py][0102-binary-tree-level-order-traversal.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0102-binary-tree-level-order-traversal.cpp][0102-binary-tree-level-order-traversal.cpp]]
 - LeetCode: [[https://leetcode.com/problems/binary-tree-level-order-traversal/][binary-tree-level-order-traversal/]]
 - Video: [[https://youtube.com/watch?v=6ZnyEApgFYg][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org][My Solution]]
-** TODO 0199. Binary Tree Right Side View :medium:
-*** Python
+** TODO 0199. Binary Tree Right Side View :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0199-binary-tree-right-side-view.py][0199-binary-tree-right-side-view.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0199-binary-tree-right-side-view.cpp][0199-binary-tree-right-side-view.cpp]]
 - LeetCode: [[https://leetcode.com/problems/binary-tree-right-side-view/][binary-tree-right-side-view/]]
 - Video: [[https://youtube.com/watch?v=d4zLyf32e3I][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0199-binary-tree-right-side-view.org][My Solution]]
-** TODO 1376. Time Needed to Inform All Employees :medium:
-*** Python
+** TODO 1376. Time Needed to Inform All Employees :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1376-time-needed-to-inform-all-employees.py][1376-time-needed-to-inform-all-employees.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1376-time-needed-to-inform-all-employees.cpp][1376-time-needed-to-inform-all-employees.cpp]]
 - LeetCode: [[https://leetcode.com/problems/time-needed-to-inform-all-employees/][time-needed-to-inform-all-employees/]]
 - Video: [[https://youtube.com/watch?v=zdBYi0p4L5Q][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org][My Solution]]
-** TODO 1448. Count Good Nodes In Binary Tree :medium:
-*** Python
+** TODO 1448. Count Good Nodes In Binary Tree :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1448-count-good-nodes-in-binary-tree.py][1448-count-good-nodes-in-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1448-count-good-nodes-in-binary-tree.cpp][1448-count-good-nodes-in-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/count-good-nodes-in-binary-tree/][count-good-nodes-in-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=7cp5imvDzl4][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org][My Solution]]
-** TODO 0098. Validate Binary Search Tree :medium:
-*** Python
+** TODO 0098. Validate Binary Search Tree :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0098-validate-binary-search-tree.py][0098-validate-binary-search-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0098-validate-binary-search-tree.cpp][0098-validate-binary-search-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/validate-binary-search-tree/][validate-binary-search-tree/]]
 - Video: [[https://youtube.com/watch?v=s6ATEkipzow][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0098-validate-binary-search-tree.org][My Solution]]
-** TODO 0230. Kth Smallest Element In a Bst :medium:
-*** Python
+** TODO 0230. Kth Smallest Element In a Bst :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0230-kth-smallest-element-in-a-bst.py][0230-kth-smallest-element-in-a-bst.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0230-kth-smallest-element-in-a-bst.cpp][0230-kth-smallest-element-in-a-bst.cpp]]
 - LeetCode: [[https://leetcode.com/problems/kth-smallest-element-in-a-bst/][kth-smallest-element-in-a-bst/]]
 - Video: [[https://youtube.com/watch?v=5LUXSvjmGCw][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org][My Solution]]
-** TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium:
-*** Python
+** TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0105-construct-binary-tree-from-preorder-and-inorder-traversal.py][0105-construct-binary-tree-from-preorder-and-inorder-traversal.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp][0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp]]
 - LeetCode: [[https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/][construct-binary-tree-from-preorder-and-inorder-traversal/]]
 - Video: [[https://youtube.com/watch?v=ihj4IQGZ2zc][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org][My Solution]]
-** TODO 1028. Recover a Tree From Preorder Traversal :hard:
-*** Python
+** TODO 1028. Recover a Tree From Preorder Traversal :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1028-recover-a-tree-from-preorder-traversal.py][1028-recover-a-tree-from-preorder-traversal.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1028-recover-a-tree-from-preorder-traversal.cpp][1028-recover-a-tree-from-preorder-traversal.cpp]]
 - LeetCode: [[https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/][recover-a-tree-from-preorder-traversal/]]
 - Video: [[https://youtube.com/watch?v=VroH6J47kIE][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org][My Solution]]
-** TODO 0124. Binary Tree Maximum Path Sum :hard:
-*** Python
+** TODO 0124. Binary Tree Maximum Path Sum :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0124-binary-tree-maximum-path-sum.py][0124-binary-tree-maximum-path-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0124-binary-tree-maximum-path-sum.cpp][0124-binary-tree-maximum-path-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/binary-tree-maximum-path-sum/][binary-tree-maximum-path-sum/]]
 - Video: [[https://youtube.com/watch?v=Hr5cWUld4vU][explanation]]
 - Notes: [[../../org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org][My Solution]]
-** TODO 0297. Serialize And Deserialize Binary Tree :hard:
-*** Python
+** TODO 0297. Serialize And Deserialize Binary Tree :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0297-serialize-and-deserialize-binary-tree.py][0297-serialize-and-deserialize-binary-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0297-serialize-and-deserialize-binary-tree.cpp][0297-serialize-and-deserialize-binary-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/serialize-and-deserialize-binary-tree/][serialize-and-deserialize-binary-tree/]]
 - Video: [[https://youtube.com/watch?v=u4JAi2JJhI8][explanation]]
@@ -651,33 +651,33 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Tries [/]
 
-** TODO 0208. Implement Trie Prefix Tree :medium:
-*** Python
+** TODO 0208. Implement Trie Prefix Tree :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0208-implement-trie-prefix-tree.py][0208-implement-trie-prefix-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0208-implement-trie-prefix-tree.cpp][0208-implement-trie-prefix-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/implement-trie-prefix-tree/][implement-trie-prefix-tree/]]
 - Video: [[https://youtube.com/watch?v=oobqoCJlHA0][explanation]]
 - Notes: [[../../org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org][My Solution]]
-** TODO 0211. Design Add And Search Words Data Structure :medium:
-*** Python
+** TODO 0211. Design Add And Search Words Data Structure :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0211-design-add-and-search-words-data-structure.py][0211-design-add-and-search-words-data-structure.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0211-design-add-and-search-words-data-structure.cpp][0211-design-add-and-search-words-data-structure.cpp]]
 - LeetCode: [[https://leetcode.com/problems/design-add-and-search-words-data-structure/][design-add-and-search-words-data-structure/]]
 - Video: [[https://youtube.com/watch?v=BTf05gs_8iU][explanation]]
 - Notes: [[../../org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org][My Solution]]
-** TODO 1166. Design File System :medium:
-*** Python
+** TODO 1166. Design File System :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1166-design-file-system.py][1166-design-file-system.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1166-design-file-system.cpp][1166-design-file-system.cpp]]
 - LeetCode: [[https://leetcode.com/problems/design-file-system/][design-file-system/]]
 - Notes: [[../../org/cpp/dsa/tries/1166-design-file-system.org][My Solution]]
-** TODO 0212. Word Search II :hard:
-*** Python
+** TODO 0212. Word Search II :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0212-word-search-ii.py][0212-word-search-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0212-word-search-ii.cpp][0212-word-search-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/word-search-ii/][word-search-ii/]]
 - Video: [[https://youtube.com/watch?v=asbcE9mZz_U][explanation]]
@@ -685,58 +685,58 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Heap / Priority Queue [/]
 
-** TODO 0703. Kth Largest Element In a Stream :easy:
-*** Python
+** TODO 0703. Kth Largest Element In a Stream :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0703-kth-largest-element-in-a-stream.py][0703-kth-largest-element-in-a-stream.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0703-kth-largest-element-in-a-stream.cpp][0703-kth-largest-element-in-a-stream.cpp]]
 - LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-a-stream/][kth-largest-element-in-a-stream/]]
 - Video: [[https://youtube.com/watch?v=hOjcdrqMoQ8][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org][My Solution]]
-** TODO 1046. Last Stone Weight :easy:
-*** Python
+** TODO 1046. Last Stone Weight :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1046-last-stone-weight.py][1046-last-stone-weight.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1046-last-stone-weight.cpp][1046-last-stone-weight.cpp]]
 - LeetCode: [[https://leetcode.com/problems/last-stone-weight/][last-stone-weight/]]
 - Video: [[https://youtube.com/watch?v=B-QCq79-Vfw][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org][My Solution]]
-** TODO 0973. K Closest Points to Origin :medium:
-*** Python
+** TODO 0973. K Closest Points to Origin :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0973-k-closest-points-to-origin.py][0973-k-closest-points-to-origin.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0973-k-closest-points-to-origin.cpp][0973-k-closest-points-to-origin.cpp]]
 - LeetCode: [[https://leetcode.com/problems/k-closest-points-to-origin/][k-closest-points-to-origin/]]
 - Video: [[https://youtube.com/watch?v=rI2EBUEMfTk][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org][My Solution]]
-** TODO 0215. Kth Largest Element In An Array :medium:
-*** Python
+** TODO 0215. Kth Largest Element In An Array :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0215-kth-largest-element-in-an-array.py][0215-kth-largest-element-in-an-array.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0215-kth-largest-element-in-an-array.cpp][0215-kth-largest-element-in-an-array.cpp]]
 - LeetCode: [[https://leetcode.com/problems/kth-largest-element-in-an-array/][kth-largest-element-in-an-array/]]
 - Video: [[https://youtube.com/watch?v=XEmy13g1Qxc][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org][My Solution]]
-** TODO 0621. Task Scheduler :medium:
-*** Python
+** TODO 0621. Task Scheduler :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0621-task-scheduler.py][0621-task-scheduler.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0621-task-scheduler.cpp][0621-task-scheduler.cpp]]
 - LeetCode: [[https://leetcode.com/problems/task-scheduler/][task-scheduler/]]
 - Video: [[https://youtube.com/watch?v=s8p8ukTyA2I][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org][My Solution]]
-** TODO 0355. Design Twitter :medium:
-*** Python
+** TODO 0355. Design Twitter :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0355-design-twitter.py][0355-design-twitter.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0355-design-twitter.cpp][0355-design-twitter.cpp]]
 - LeetCode: [[https://leetcode.com/problems/design-twitter/][design-twitter/]]
 - Video: [[https://youtube.com/watch?v=pNichitDD2E][explanation]]
 - Notes: [[../../org/cpp/dsa/heap-priority-queue/0355-design-twitter.org][My Solution]]
-** TODO 0295. Find Median From Data Stream :hard:
-*** Python
+** TODO 0295. Find Median From Data Stream :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0295-find-median-from-data-stream.py][0295-find-median-from-data-stream.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0295-find-median-from-data-stream.cpp][0295-find-median-from-data-stream.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-median-from-data-stream/][find-median-from-data-stream/]]
 - Video: [[https://youtube.com/watch?v=itmhHWaHupI][explanation]]
@@ -744,121 +744,121 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Backtracking [/]
 
-** TODO 1863. Sum of All Subsets XOR Total :easy:
-*** Python
+** TODO 1863. Sum of All Subsets XOR Total :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1863-sum-of-all-subset-xor-totals.py][1863-sum-of-all-subset-xor-totals.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1863-sum-of-all-subset-xor-totals.cpp][1863-sum-of-all-subset-xor-totals.cpp]]
 - LeetCode: [[https://leetcode.com/problems/sum-of-all-subset-xor-totals/][sum-of-all-subset-xor-totals/]]
 - Video: [[https://youtube.com/watch?v=LI7YR-bwNYY][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/1863-sum-of-all-subset-xor-totals.org][My Solution]]
-** TODO 0078. Subsets :medium:
-*** Python
+** TODO 0078. Subsets :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0078-subsets.py][0078-subsets.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0078-subsets.cpp][0078-subsets.cpp]]
 - LeetCode: [[https://leetcode.com/problems/subsets/][subsets/]]
 - Video: [[https://youtube.com/watch?v=REOH22Xwdkk][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0078-subsets.org][My Solution]]
-** TODO 0039. Combination Sum :medium:
-*** Python
+** TODO 0039. Combination Sum :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0039-combination-sum.py][0039-combination-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0039-combination-sum.cpp][0039-combination-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/combination-sum/][combination-sum/]]
 - Video: [[https://youtube.com/watch?v=GBKI9VSKdGg][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0039-combination-sum.org][My Solution]]
-** TODO 0040. Combination Sum II :medium:
-*** Python
+** TODO 0040. Combination Sum II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0040-combination-sum-ii.py][0040-combination-sum-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0040-combination-sum-ii.cpp][0040-combination-sum-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/combination-sum-ii/][combination-sum-ii/]]
 - Video: [[https://youtube.com/watch?v=FOyRpNUSFeA][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0040-combination-sum-ii.org][My Solution]]
-** TODO 0077. Combinations :medium:
-*** Python
+** TODO 0077. Combinations :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0077-combinations.py][0077-combinations.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0077-combinations.cpp][0077-combinations.cpp]]
 - LeetCode: [[https://leetcode.com/problems/combinations/][combinations/]]
 - Video: [[https://youtube.com/watch?v=q0s6m7AiM7o][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0077-combinations.org][My Solution]]
-** TODO 0046. Permutations :medium:
-*** Python
+** TODO 0046. Permutations :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0046-permutations.py][0046-permutations.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0046-permutations.cpp][0046-permutations.cpp]]
 - LeetCode: [[https://leetcode.com/problems/permutations/][permutations/]]
 - Video: [[https://youtube.com/watch?v=FZe0UqISmUw][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0046-permutations.org][My Solution]]
-** TODO 0090. Subsets II :medium:
-*** Python
+** TODO 0090. Subsets II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0090-subsets-ii.py][0090-subsets-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0090-subsets-ii.cpp][0090-subsets-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/subsets-ii/][subsets-ii/]]
 - Video: [[https://youtube.com/watch?v=Vn2v6ajA7U0][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0090-subsets-ii.org][My Solution]]
-** TODO 0022. Generate Parentheses :medium:
-*** Python
+** TODO 0022. Generate Parentheses :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0022-generate-parentheses.py][0022-generate-parentheses.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0022-generate-parentheses.cpp][0022-generate-parentheses.cpp]]
 - LeetCode: [[https://leetcode.com/problems/generate-parentheses/][generate-parentheses/]]
 - Video: [[https://youtube.com/watch?v=s9fokUqJ76A][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0022-generate-parentheses.org][My Solution]]
-** TODO 1079. Letter Tile Possibilities :medium:
-*** Python
+** TODO 1079. Letter Tile Possibilities :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1079-letter-tile-possibilities.py][1079-letter-tile-possibilities.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1079-letter-tile-possibilities.cpp][1079-letter-tile-possibilities.cpp]]
 - LeetCode: [[https://leetcode.com/problems/letter-tile-possibilities/][letter-tile-possibilities/]]
 - Video: [[https://youtube.com/watch?v=8FrJX-P_DnE][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org][My Solution]]
-** TODO 0079. Word Search :medium:
-*** Python
+** TODO 0079. Word Search :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0079-word-search.py][0079-word-search.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0079-word-search.cpp][0079-word-search.cpp]]
 - LeetCode: [[https://leetcode.com/problems/word-search/][word-search/]]
 - Video: [[https://youtube.com/watch?v=pfiQ_PS1g8E][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0079-word-search.org][My Solution]]
-** TODO 0131. Palindrome Partitioning :medium:
-*** Python
+** TODO 0131. Palindrome Partitioning :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0131-palindrome-partitioning.py][0131-palindrome-partitioning.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0131-palindrome-partitioning.cpp][0131-palindrome-partitioning.cpp]]
 - LeetCode: [[https://leetcode.com/problems/palindrome-partitioning/][palindrome-partitioning/]]
 - Video: [[https://youtube.com/watch?v=3jvWodd7ht0][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0131-palindrome-partitioning.org][My Solution]]
-** TODO 0017. Letter Combinations of a Phone Number :medium:
-*** Python
+** TODO 0017. Letter Combinations of a Phone Number :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0017-letter-combinations-of-a-phone-number.py][0017-letter-combinations-of-a-phone-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0017-letter-combinations-of-a-phone-number.cpp][0017-letter-combinations-of-a-phone-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/letter-combinations-of-a-phone-number/][letter-combinations-of-a-phone-number/]]
 - Video: [[https://youtube.com/watch?v=0snEunUacZY][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org][My Solution]]
-** TODO 0351. Android Unlock Patterns :medium:
-*** Python
+** TODO 0351. Android Unlock Patterns :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0351-android-unlock-patterns.py][0351-android-unlock-patterns.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0351-android-unlock-patterns.cpp][0351-android-unlock-patterns.cpp]]
 - LeetCode: [[https://leetcode.com/problems/android-unlock-patterns/][android-unlock-patterns/]]
 - Notes: [[../../org/cpp/dsa/backtracking/0351-android-unlock-patterns.org][My Solution]]
-** TODO 0051. N Queens :hard:
-*** Python
+** TODO 0051. N Queens :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0051-n-queens.py][0051-n-queens.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0051-n-queens.cpp][0051-n-queens.cpp]]
 - LeetCode: [[https://leetcode.com/problems/n-queens/][n-queens/]]
 - Video: [[https://youtube.com/watch?v=Ph95IHmRp5M][explanation]]
 - Notes: [[../../org/cpp/dsa/backtracking/0051-n-queens.org][My Solution]]
-** TODO 0052. N Queens II :hard:
-*** Python
+** TODO 0052. N Queens II :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0052-n-queens-ii.py][0052-n-queens-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0052-n-queens-ii.cpp][0052-n-queens-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/n-queens-ii/][n-queens-ii/]]
 - Video: [[https://youtube.com/watch?v=nalYyLZgvCY][explanation]]
@@ -866,146 +866,146 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Graphs [/]
 
-** TODO 2924. Find Champion II :medium:
-*** Python
+** TODO 2924. Find Champion II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2924-find-champion-ii.py][2924-find-champion-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2924-find-champion-ii.cpp][2924-find-champion-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-champion-ii/][find-champion-ii/]]
 - Video: [[https://youtube.com/watch?v=HjSmSLPR7S4][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/2924-find-champion-ii.org][My Solution]]
-** TODO 0200. Number of Islands :medium:
-*** Python
+** TODO 0200. Number of Islands :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0200-number-of-islands.py][0200-number-of-islands.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0200-number-of-islands.cpp][0200-number-of-islands.cpp]]
 - LeetCode: [[https://leetcode.com/problems/number-of-islands/][number-of-islands/]]
 - Video: [[https://youtube.com/watch?v=pV2kpPD66nE][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0200-number-of-islands.org][My Solution]]
-** TODO 0695. Max Area of Island :medium:
-*** Python
+** TODO 0695. Max Area of Island :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0695-max-area-of-island.py][0695-max-area-of-island.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0695-max-area-of-island.cpp][0695-max-area-of-island.cpp]]
 - LeetCode: [[https://leetcode.com/problems/max-area-of-island/][max-area-of-island/]]
 - Video: [[https://youtube.com/watch?v=iJGr1OtmH0c][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0695-max-area-of-island.org][My Solution]]
-** TODO 2658. Maximum Number of Fish in a Grid :medium:
-*** Python
+** TODO 2658. Maximum Number of Fish in a Grid :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2658-maximum-number-of-fish-in-a-grid.py][2658-maximum-number-of-fish-in-a-grid.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2658-maximum-number-of-fish-in-a-grid.cpp][2658-maximum-number-of-fish-in-a-grid.cpp]]
 - LeetCode: [[https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/][maximum-number-of-fish-in-a-grid/]]
 - Video: [[https://youtube.com/watch?v=JhAz6CkRGHI][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org][My Solution]]
-** TODO 0133. Clone Graph :medium:
-*** Python
+** TODO 0133. Clone Graph :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0133-clone-graph.py][0133-clone-graph.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0133-clone-graph.cpp][0133-clone-graph.cpp]]
 - LeetCode: [[https://leetcode.com/problems/clone-graph/][clone-graph/]]
 - Video: [[https://youtube.com/watch?v=mQeF6bN8hMk][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0133-clone-graph.org][My Solution]]
-** TODO 0286. Walls And Gates :medium:
-*** Python
+** TODO 0286. Walls And Gates :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0286-walls-and-gates.py][0286-walls-and-gates.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0286-walls-and-gates.cpp][0286-walls-and-gates.cpp]]
 - LeetCode: [[https://leetcode.com/problems/walls-and-gates/][walls-and-gates/]]
 - Video: [[https://youtube.com/watch?v=e69C6xhiSQE][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0286-walls-and-gates.org][My Solution]]
-** TODO 0994. Rotting Oranges :medium:
-*** Python
+** TODO 0994. Rotting Oranges :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0994-rotting-oranges.py][0994-rotting-oranges.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0994-rotting-oranges.cpp][0994-rotting-oranges.cpp]]
 - LeetCode: [[https://leetcode.com/problems/rotting-oranges/][rotting-oranges/]]
 - Video: [[https://youtube.com/watch?v=y704fEOx0s0][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0994-rotting-oranges.org][My Solution]]
-** TODO 1905. Count Sub Islands :medium:
-*** Python
+** TODO 1905. Count Sub Islands :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1905-count-sub-islands.py][1905-count-sub-islands.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1905-count-sub-islands.cpp][1905-count-sub-islands.cpp]]
 - LeetCode: [[https://leetcode.com/problems/count-sub-islands/][count-sub-islands/]]
 - Video: [[https://youtube.com/watch?v=mLpW3qfbNJ8][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/1905-count-sub-islands.org][My Solution]]
-** TODO 0417. Pacific Atlantic Water Flow :medium:
-*** Python
+** TODO 0417. Pacific Atlantic Water Flow :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0417-pacific-atlantic-water-flow.py][0417-pacific-atlantic-water-flow.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0417-pacific-atlantic-water-flow.cpp][0417-pacific-atlantic-water-flow.cpp]]
 - LeetCode: [[https://leetcode.com/problems/pacific-atlantic-water-flow/][pacific-atlantic-water-flow/]]
 - Video: [[https://youtube.com/watch?v=s-VkcjHqkGI][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org][My Solution]]
-** TODO 0130. Surrounded Regions :medium:
-*** Python
+** TODO 0130. Surrounded Regions :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0130-surrounded-regions.py][0130-surrounded-regions.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0130-surrounded-regions.cpp][0130-surrounded-regions.cpp]]
 - LeetCode: [[https://leetcode.com/problems/surrounded-regions/][surrounded-regions/]]
 - Video: [[https://youtube.com/watch?v=9z2BunfoZ5Y][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0130-surrounded-regions.org][My Solution]]
-** TODO 0802. Find Eventual Safe States :medium:
-*** Python
+** TODO 0802. Find Eventual Safe States :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0802-find-eventual-safe-states.py][0802-find-eventual-safe-states.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0802-find-eventual-safe-states.cpp][0802-find-eventual-safe-states.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-eventual-safe-states/][find-eventual-safe-states/]]
 - Video: [[https://youtube.com/watch?v=Re_v0j0CRsg][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0802-find-eventual-safe-states.org][My Solution]]
-** TODO 0207. Course Schedule :medium:
-*** Python
+** TODO 0207. Course Schedule :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0207-course-schedule.py][0207-course-schedule.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0207-course-schedule.cpp][0207-course-schedule.cpp]]
 - LeetCode: [[https://leetcode.com/problems/course-schedule/][course-schedule/]]
 - Video: [[https://youtube.com/watch?v=EgI5nU9etnU][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0207-course-schedule.org][My Solution]]
-** TODO 0210. Course Schedule II :medium:
-*** Python
+** TODO 0210. Course Schedule II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0210-course-schedule-ii.py][0210-course-schedule-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0210-course-schedule-ii.cpp][0210-course-schedule-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/course-schedule-ii/][course-schedule-ii/]]
 - Video: [[https://youtube.com/watch?v=Akt3glAwyfY][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0210-course-schedule-ii.org][My Solution]]
-** TODO 0261. Graph Valid Tree :medium:
-*** Python
+** TODO 0261. Graph Valid Tree :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0261-graph-valid-tree.py][0261-graph-valid-tree.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0261-graph-valid-tree.cpp][0261-graph-valid-tree.cpp]]
 - LeetCode: [[https://leetcode.com/problems/graph-valid-tree/][graph-valid-tree/]]
 - Video: [[https://youtube.com/watch?v=bXsUuownnoQ][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0261-graph-valid-tree.org][My Solution]]
-** TODO 0323. Number of Connected Components In An Undirected Graph :medium:
-*** Python
+** TODO 0323. Number of Connected Components In An Undirected Graph :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0323-number-of-connected-components-in-an-undirected-graph.py][0323-number-of-connected-components-in-an-undirected-graph.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0323-number-of-connected-components-in-an-undirected-graph.cpp][0323-number-of-connected-components-in-an-undirected-graph.cpp]]
 - LeetCode: [[https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/][number-of-connected-components-in-an-undirected-graph/]]
 - Video: [[https://youtube.com/watch?v=8f1XPm4WOUc][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org][My Solution]]
-** TODO 0684. Redundant Connection :medium:
-*** Python
+** TODO 0684. Redundant Connection :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0684-redundant-connection.py][0684-redundant-connection.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0684-redundant-connection.cpp][0684-redundant-connection.cpp]]
 - LeetCode: [[https://leetcode.com/problems/redundant-connection/][redundant-connection/]]
 - Video: [[https://youtube.com/watch?v=1lNK80tOTfc][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/0684-redundant-connection.org][My Solution]]
-** TODO 2092. Find All People With Secret :hard:
-*** Python
+** TODO 2092. Find All People With Secret :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2092-find-all-people-with-secret.py][2092-find-all-people-with-secret.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2092-find-all-people-with-secret.cpp][2092-find-all-people-with-secret.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-all-people-with-secret/][find-all-people-with-secret/]]
 - Video: [[https://youtube.com/watch?v=1XujGRSU1bQ][explanation]]
 - Notes: [[../../org/cpp/dsa/graphs/2092-find-all-people-with-secret.org][My Solution]]
-** TODO 0127. Word Ladder :hard:
-*** Python
+** TODO 0127. Word Ladder :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0127-word-ladder.py][0127-word-ladder.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0127-word-ladder.cpp][0127-word-ladder.cpp]]
 - LeetCode: [[https://leetcode.com/problems/word-ladder/][word-ladder/]]
 - Video: [[https://youtube.com/watch?v=h9iTnkgv05E][explanation]]
@@ -1013,163 +1013,163 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO 1-D Dynamic Programming [/]
 
-** TODO 0070. Climbing Stairs :easy:
-*** Python
+** TODO 0070. Climbing Stairs :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0070-climbing-stairs.py][0070-climbing-stairs.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0070-climbing-stairs.cpp][0070-climbing-stairs.cpp]]
 - LeetCode: [[https://leetcode.com/problems/climbing-stairs/][climbing-stairs/]]
 - Video: [[https://youtube.com/watch?v=Y0lT9Fck7qI][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org][My Solution]]
-** TODO 0746. Min Cost Climbing Stairs :easy:
-*** Python
+** TODO 0746. Min Cost Climbing Stairs :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0746-min-cost-climbing-stairs.py][0746-min-cost-climbing-stairs.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0746-min-cost-climbing-stairs.cpp][0746-min-cost-climbing-stairs.cpp]]
 - LeetCode: [[https://leetcode.com/problems/min-cost-climbing-stairs/][min-cost-climbing-stairs/]]
 - Video: [[https://youtube.com/watch?v=ktmzAZWkEZ0][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org][My Solution]]
-** TODO 0198. House Robber :medium:
-*** Python
+** TODO 0198. House Robber :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0198-house-robber.py][0198-house-robber.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0198-house-robber.cpp][0198-house-robber.cpp]]
 - LeetCode: [[https://leetcode.com/problems/house-robber/][house-robber/]]
 - Video: [[https://youtube.com/watch?v=73r3KWiEvyk][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org][My Solution]]
-** TODO 0213. House Robber II :medium:
-*** Python
+** TODO 0213. House Robber II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0213-house-robber-ii.py][0213-house-robber-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0213-house-robber-ii.cpp][0213-house-robber-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/house-robber-ii/][house-robber-ii/]]
 - Video: [[https://youtube.com/watch?v=rWAJCfYYOvM][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org][My Solution]]
-** TODO 0005. Longest Palindromic Substring :medium:
-*** Python
+** TODO 0005. Longest Palindromic Substring :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0005-longest-palindromic-substring.py][0005-longest-palindromic-substring.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0005-longest-palindromic-substring.cpp][0005-longest-palindromic-substring.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-palindromic-substring/][longest-palindromic-substring/]]
 - Video: [[https://youtube.com/watch?v=XYQecbcd6_c][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org][My Solution]]
-** TODO 0647. Palindromic Substrings :medium:
-*** Python
+** TODO 0647. Palindromic Substrings :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0647-palindromic-substrings.py][0647-palindromic-substrings.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0647-palindromic-substrings.cpp][0647-palindromic-substrings.cpp]]
 - LeetCode: [[https://leetcode.com/problems/palindromic-substrings/][palindromic-substrings/]]
 - Video: [[https://youtube.com/watch?v=4RACzI5-du8][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org][My Solution]]
-** TODO 0091. Decode Ways :medium:
-*** Python
+** TODO 0091. Decode Ways :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0091-decode-ways.py][0091-decode-ways.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0091-decode-ways.cpp][0091-decode-ways.cpp]]
 - LeetCode: [[https://leetcode.com/problems/decode-ways/][decode-ways/]]
 - Video: [[https://youtube.com/watch?v=6aEyTjOwlJU][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org][My Solution]]
-** TODO 0322. Coin Change :medium:
-*** Python
+** TODO 0322. Coin Change :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0322-coin-change.py][0322-coin-change.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0322-coin-change.cpp][0322-coin-change.cpp]]
 - LeetCode: [[https://leetcode.com/problems/coin-change/][coin-change/]]
 - Video: [[https://youtube.com/watch?v=H9bfqozjoqs][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org][My Solution]]
-** TODO 0152. Maximum Product Subarray :medium:
-*** Python
+** TODO 0152. Maximum Product Subarray :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0152-maximum-product-subarray.py][0152-maximum-product-subarray.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0152-maximum-product-subarray.cpp][0152-maximum-product-subarray.cpp]]
 - LeetCode: [[https://leetcode.com/problems/maximum-product-subarray/][maximum-product-subarray/]]
 - Video: [[https://youtube.com/watch?v=lXVy6YWFcRM][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org][My Solution]]
-** TODO 0139. Word Break :medium:
-*** Python
+** TODO 0139. Word Break :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0139-word-break.py][0139-word-break.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0139-word-break.cpp][0139-word-break.cpp]]
 - LeetCode: [[https://leetcode.com/problems/word-break/][word-break/]]
 - Video: [[https://youtube.com/watch?v=Sx9NNgInc3A][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org][My Solution]]
-** TODO 0300. Longest Increasing Subsequence :medium:
-*** Python
+** TODO 0300. Longest Increasing Subsequence :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0300-longest-increasing-subsequence.py][0300-longest-increasing-subsequence.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0300-longest-increasing-subsequence.cpp][0300-longest-increasing-subsequence.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-increasing-subsequence/][longest-increasing-subsequence/]]
 - Video: [[https://youtube.com/watch?v=cjWnW0hdF1Y][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org][My Solution]]
-** TODO 0416. Partition Equal Subset Sum :medium:
-*** Python
+** TODO 0416. Partition Equal Subset Sum :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0416-partition-equal-subset-sum.py][0416-partition-equal-subset-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0416-partition-equal-subset-sum.cpp][0416-partition-equal-subset-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/partition-equal-subset-sum/][partition-equal-subset-sum/]]
 - Video: [[https://youtube.com/watch?v=IsvocB5BJhw][explanation]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org][My Solution]]
-** TODO 0656. Coin Path :hard:
-*** Python
+** TODO 0656. Coin Path :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0656-coin-path.py][0656-coin-path.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0656-coin-path.cpp][0656-coin-path.cpp]]
 - LeetCode: [[https://leetcode.com/problems/coin-path/][coin-path/]]
 - Notes: [[../../org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org][My Solution]]
 
 * TODO Intervals [/]
 
-** TODO 0057. Insert Interval :medium:
-*** Python
+** TODO 0057. Insert Interval :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0057-insert-interval.py][0057-insert-interval.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0057-insert-interval.cpp][0057-insert-interval.cpp]]
 - LeetCode: [[https://leetcode.com/problems/insert-interval/][insert-interval/]]
 - Video: [[https://youtube.com/watch?v=A8NUOmlwOlM][explanation]]
 - Notes: [[../../org/cpp/dsa/intervals/0057-insert-interval.org][My Solution]]
-** TODO 0056. Merge Intervals :medium:
-*** Python
+** TODO 0056. Merge Intervals :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0056-merge-intervals.py][0056-merge-intervals.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0056-merge-intervals.cpp][0056-merge-intervals.cpp]]
 - LeetCode: [[https://leetcode.com/problems/merge-intervals/][merge-intervals/]]
 - Video: [[https://youtube.com/watch?v=44H3cEC2fFM][explanation]]
 - Notes: [[../../org/cpp/dsa/intervals/0056-merge-intervals.org][My Solution]]
-** TODO 0435. Non Overlapping Intervals :medium:
-*** Python
+** TODO 0435. Non Overlapping Intervals :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0435-non-overlapping-intervals.py][0435-non-overlapping-intervals.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0435-non-overlapping-intervals.cpp][0435-non-overlapping-intervals.cpp]]
 - LeetCode: [[https://leetcode.com/problems/non-overlapping-intervals/][non-overlapping-intervals/]]
 - Video: [[https://youtube.com/watch?v=nONCGxWoUfM][explanation]]
 - Notes: [[../../org/cpp/dsa/intervals/0435-non-overlapping-intervals.org][My Solution]]
-** TODO 0986. Interval List Intersections :medium:
-*** Python
+** TODO 0986. Interval List Intersections :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0986-interval-list-intersections.py][0986-interval-list-intersections.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0986-interval-list-intersections.cpp][0986-interval-list-intersections.cpp]]
 - LeetCode: [[https://leetcode.com/problems/interval-list-intersections/][interval-list-intersections/]]
 - Notes: [[../../org/cpp/dsa/intervals/0986-interval-list-intersections.org][My Solution]]
-** TODO 0252. Meeting Rooms :easy:
-*** Python
+** TODO 0252. Meeting Rooms :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0252-meeting-rooms.py][0252-meeting-rooms.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0252-meeting-rooms.cpp][0252-meeting-rooms.cpp]]
 - LeetCode: [[https://leetcode.com/problems/meeting-rooms/][meeting-rooms/]]
 - Video: [[https://youtube.com/watch?v=PaJxqZVPhbg][explanation]]
 - Notes: [[../../org/cpp/dsa/intervals/0252-meeting-rooms.org][My Solution]]
-** TODO 0253. Meeting Rooms II :medium:
-*** Python
+** TODO 0253. Meeting Rooms II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0253-meeting-rooms-ii.py][0253-meeting-rooms-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0253-meeting-rooms-ii.cpp][0253-meeting-rooms-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/meeting-rooms-ii/][meeting-rooms-ii/]]
 - Video: [[https://youtube.com/watch?v=FdzJmTCVyJU][explanation]]
 - Notes: [[../../org/cpp/dsa/intervals/0253-meeting-rooms-ii.org][My Solution]]
-** TODO 1851. Minimum Interval to Include Each Query :hard:
-*** Python
+** TODO 1851. Minimum Interval to Include Each Query :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1851-minimum-interval-to-include-each-query.py][1851-minimum-interval-to-include-each-query.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1851-minimum-interval-to-include-each-query.cpp][1851-minimum-interval-to-include-each-query.cpp]]
 - LeetCode: [[https://leetcode.com/problems/minimum-interval-to-include-each-query/][minimum-interval-to-include-each-query/]]
 - Video: [[https://youtube.com/watch?v=5hQ5WWW5awQ][explanation]]
@@ -1177,90 +1177,90 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Greedy [/]
 
-** TODO 0945. Minimum Increment to Make Array Unique :medium:
-*** Python
+** TODO 0945. Minimum Increment to Make Array Unique :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0945-minimum-increment-to-make-array-unique.py][0945-minimum-increment-to-make-array-unique.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0945-minimum-increment-to-make-array-unique.cpp][0945-minimum-increment-to-make-array-unique.cpp]]
 - LeetCode: [[https://leetcode.com/problems/minimum-increment-to-make-array-unique/][minimum-increment-to-make-array-unique/]]
 - Video: [[https://youtube.com/watch?v=XPPs2Wj2YSk][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org][My Solution]]
-** TODO 0053. Maximum Subarray :medium:
-*** Python
+** TODO 0053. Maximum Subarray :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0053-maximum-subarray.py][0053-maximum-subarray.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0053-maximum-subarray.cpp][0053-maximum-subarray.cpp]]
 - LeetCode: [[https://leetcode.com/problems/maximum-subarray/][maximum-subarray/]]
 - Video: [[https://youtube.com/watch?v=5WZl3MMT0Eg][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0053-maximum-subarray.org][My Solution]]
-** TODO 0978. Longest Turbulent Subarray :medium:
-*** Python
+** TODO 0978. Longest Turbulent Subarray :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0978-longest-turbulent-subarray.py][0978-longest-turbulent-subarray.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0978-longest-turbulent-subarray.cpp][0978-longest-turbulent-subarray.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-turbulent-subarray/][longest-turbulent-subarray/]]
 - Video: [[https://youtube.com/watch?v=V_iHUhR8Dek][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org][My Solution]]
-** TODO 0055. Jump Game :medium:
-*** Python
+** TODO 0055. Jump Game :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0055-jump-game.py][0055-jump-game.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0055-jump-game.cpp][0055-jump-game.cpp]]
 - LeetCode: [[https://leetcode.com/problems/jump-game/][jump-game/]]
 - Video: [[https://youtube.com/watch?v=Yan0cv2cLy8][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0055-jump-game.org][My Solution]]
-** TODO 0045. Jump Game II :medium:
-*** Python
+** TODO 0045. Jump Game II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0045-jump-game-ii.py][0045-jump-game-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0045-jump-game-ii.cpp][0045-jump-game-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/jump-game-ii/][jump-game-ii/]]
 - Video: [[https://youtube.com/watch?v=dJ7sWiOoK7g][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0045-jump-game-ii.org][My Solution]]
-** TODO 1871. Jump Game VII :medium:
-*** Python
+** TODO 1871. Jump Game VII :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1871-jump-game-vii.py][1871-jump-game-vii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1871-jump-game-vii.cpp][1871-jump-game-vii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/jump-game-vii/][jump-game-vii/]]
 - Video: [[https://youtube.com/watch?v=v1HpZUnQ4Yo][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/1871-jump-game-vii.org][My Solution]]
-** TODO 0134. Gas Station :medium:
-*** Python
+** TODO 0134. Gas Station :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0134-gas-station.py][0134-gas-station.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0134-gas-station.cpp][0134-gas-station.cpp]]
 - LeetCode: [[https://leetcode.com/problems/gas-station/][gas-station/]]
 - Video: [[https://youtube.com/watch?v=lJwbPZGo05A][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0134-gas-station.org][My Solution]]
-** TODO 0846. Hand of Straights :medium:
-*** Python
+** TODO 0846. Hand of Straights :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0846-hand-of-straights.py][0846-hand-of-straights.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0846-hand-of-straights.cpp][0846-hand-of-straights.cpp]]
 - LeetCode: [[https://leetcode.com/problems/hand-of-straights/][hand-of-straights/]]
 - Video: [[https://youtube.com/watch?v=amnrMCVd2YI][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0846-hand-of-straights.org][My Solution]]
-** TODO 1899. Merge Triplets to Form Target Triplet :medium:
-*** Python
+** TODO 1899. Merge Triplets to Form Target Triplet :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1899-merge-triplets-to-form-target-triplet.py][1899-merge-triplets-to-form-target-triplet.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1899-merge-triplets-to-form-target-triplet.cpp][1899-merge-triplets-to-form-target-triplet.cpp]]
 - LeetCode: [[https://leetcode.com/problems/merge-triplets-to-form-target-triplet/][merge-triplets-to-form-target-triplet/]]
 - Video: [[https://youtube.com/watch?v=kShkQLQZ9K4][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org][My Solution]]
-** TODO 0763. Partition Labels :medium:
-*** Python
+** TODO 0763. Partition Labels :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0763-partition-labels.py][0763-partition-labels.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0763-partition-labels.cpp][0763-partition-labels.cpp]]
 - LeetCode: [[https://leetcode.com/problems/partition-labels/][partition-labels/]]
 - Video: [[https://youtube.com/watch?v=B7m8UmZE-vw][explanation]]
 - Notes: [[../../org/cpp/dsa/greedy/0763-partition-labels.org][My Solution]]
-** TODO 0678. Valid Parenthesis String :medium:
-*** Python
+** TODO 0678. Valid Parenthesis String :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0678-valid-parenthesis-string.py][0678-valid-parenthesis-string.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0678-valid-parenthesis-string.cpp][0678-valid-parenthesis-string.cpp]]
 - LeetCode: [[https://leetcode.com/problems/valid-parenthesis-string/][valid-parenthesis-string/]]
 - Video: [[https://youtube.com/watch?v=QhPdNS143Qg][explanation]]
@@ -1268,66 +1268,66 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Advanced Graphs [/]
 
-** TODO 0743. Network Delay Time :medium:
-*** Python
+** TODO 0743. Network Delay Time :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0743-network-delay-time.py][0743-network-delay-time.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0743-network-delay-time.cpp][0743-network-delay-time.cpp]]
 - LeetCode: [[https://leetcode.com/problems/network-delay-time/][network-delay-time/]]
 - Video: [[https://youtube.com/watch?v=EaphyqKU4PQ][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/0743-network-delay-time.org][My Solution]]
-** TODO 0332. Reconstruct Itinerary :hard:
-*** Python
+** TODO 0332. Reconstruct Itinerary :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0332-reconstruct-itinerary.py][0332-reconstruct-itinerary.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0332-reconstruct-itinerary.cpp][0332-reconstruct-itinerary.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reconstruct-itinerary/][reconstruct-itinerary/]]
 - Video: [[https://youtube.com/watch?v=ZyB_gQ8vqGA][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org][My Solution]]
-** TODO 1584. Min Cost to Connect All Points :medium:
-*** Python
+** TODO 1584. Min Cost to Connect All Points :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1584-min-cost-to-connect-all-points.py][1584-min-cost-to-connect-all-points.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1584-min-cost-to-connect-all-points.cpp][1584-min-cost-to-connect-all-points.cpp]]
 - LeetCode: [[https://leetcode.com/problems/min-cost-to-connect-all-points/][min-cost-to-connect-all-points/]]
 - Video: [[https://youtube.com/watch?v=f7JOBJIC-NA][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org][My Solution]]
-** TODO 2812. Find the Safest Path in a Grid :medium:
-*** Python
+** TODO 2812. Find the Safest Path in a Grid :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2812-find-the-safest-path-in-a-grid.py][2812-find-the-safest-path-in-a-grid.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2812-find-the-safest-path-in-a-grid.cpp][2812-find-the-safest-path-in-a-grid.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-the-safest-path-in-a-grid/][find-the-safest-path-in-a-grid/]]
 - Video: [[https://youtube.com/watch?v=-5mQcNiVWTs][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org][My Solution]]
-** TODO 0778. Swim In Rising Water :hard:
-*** Python
+** TODO 0778. Swim In Rising Water :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0778-swim-in-rising-water.py][0778-swim-in-rising-water.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0778-swim-in-rising-water.cpp][0778-swim-in-rising-water.cpp]]
 - LeetCode: [[https://leetcode.com/problems/swim-in-rising-water/][swim-in-rising-water/]]
 - Video: [[https://youtube.com/watch?v=amvrKlMLuGY][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org][My Solution]]
-** TODO 0269. Alien Dictionary :hard:
-*** Python
+** TODO 0269. Alien Dictionary :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0269-alien-dictionary.py][0269-alien-dictionary.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0269-alien-dictionary.cpp][0269-alien-dictionary.cpp]]
 - LeetCode: [[https://leetcode.com/problems/alien-dictionary/][alien-dictionary/]]
 - Video: [[https://youtube.com/watch?v=6kTZYvNNyps][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org][My Solution]]
-** TODO 0787. Cheapest Flights Within K Stops :medium:
-*** Python
+** TODO 0787. Cheapest Flights Within K Stops :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0787-cheapest-flights-within-k-stops.py][0787-cheapest-flights-within-k-stops.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0787-cheapest-flights-within-k-stops.cpp][0787-cheapest-flights-within-k-stops.cpp]]
 - LeetCode: [[https://leetcode.com/problems/cheapest-flights-within-k-stops/][cheapest-flights-within-k-stops/]]
 - Video: [[https://youtube.com/watch?v=5eIK3zUdYmE][explanation]]
 - Notes: [[../../org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org][My Solution]]
-** TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
-*** Python
+** TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2493-divide-nodes-into-the-maximum-number-of-groups.py][2493-divide-nodes-into-the-maximum-number-of-groups.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2493-divide-nodes-into-the-maximum-number-of-groups.cpp][2493-divide-nodes-into-the-maximum-number-of-groups.cpp]]
 - LeetCode: [[https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/][divide-nodes-into-the-maximum-number-of-groups/]]
 - Video: [[https://youtube.com/watch?v=Gn0ADjje8Rg][explanation]]
@@ -1335,82 +1335,82 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Bit Manipulation [/]
 
-** TODO 0136. Single Number :easy:
-*** Python
+** TODO 0136. Single Number :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0136-single-number.py][0136-single-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0136-single-number.cpp][0136-single-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/single-number/][single-number/]]
 - Video: [[https://youtube.com/watch?v=qMPX1AOa83k][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0136-single-number.org][My Solution]]
-** TODO 0260. Single Number III :medium:
-*** Python
+** TODO 0260. Single Number III :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0260-single-number-iii.py][0260-single-number-iii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0260-single-number-iii.cpp][0260-single-number-iii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/single-number-iii/][single-number-iii/]]
 - Video: [[https://youtube.com/watch?v=faoVORjd-T8][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0260-single-number-iii.org][My Solution]]
-** TODO 0191. Number of 1 Bits :easy:
-*** Python
+** TODO 0191. Number of 1 Bits :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0191-number-of-1-bits.py][0191-number-of-1-bits.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0191-number-of-1-bits.cpp][0191-number-of-1-bits.cpp]]
 - LeetCode: [[https://leetcode.com/problems/number-of-1-bits/][number-of-1-bits/]]
 - Video: [[https://youtube.com/watch?v=5Km3utixwZs][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org][My Solution]]
-** TODO 0338. Counting Bits :easy:
-*** Python
+** TODO 0338. Counting Bits :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0338-counting-bits.py][0338-counting-bits.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0338-counting-bits.cpp][0338-counting-bits.cpp]]
 - LeetCode: [[https://leetcode.com/problems/counting-bits/][counting-bits/]]
 - Video: [[https://youtube.com/watch?v=RyBM56RIWrM][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0338-counting-bits.org][My Solution]]
-** TODO 2220. Minimum Bit Flips to Convert Number :easy:
-*** Python
+** TODO 2220. Minimum Bit Flips to Convert Number :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2220-minimum-bit-flips-to-convert-number.py][2220-minimum-bit-flips-to-convert-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2220-minimum-bit-flips-to-convert-number.cpp][2220-minimum-bit-flips-to-convert-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/minimum-bit-flips-to-convert-number/][minimum-bit-flips-to-convert-number/]]
 - Video: [[https://youtube.com/watch?v=yz48myznqQY][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org][My Solution]]
-** TODO 0190. Reverse Bits :easy:
-*** Python
+** TODO 0190. Reverse Bits :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0190-reverse-bits.py][0190-reverse-bits.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0190-reverse-bits.cpp][0190-reverse-bits.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reverse-bits/][reverse-bits/]]
 - Video: [[https://youtube.com/watch?v=UcoN6UjAI64][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0190-reverse-bits.org][My Solution]]
-** TODO 0268. Missing Number :easy:
-*** Python
+** TODO 0268. Missing Number :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0268-missing-number.py][0268-missing-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0268-missing-number.cpp][0268-missing-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/missing-number/][missing-number/]]
 - Video: [[https://youtube.com/watch?v=WnPLSRLSANE][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0268-missing-number.org][My Solution]]
-** TODO 0231. Power of Two :easy:
-*** Python
+** TODO 0231. Power of Two :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0231-power-of-two.py][0231-power-of-two.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0231-power-of-two.cpp][0231-power-of-two.cpp]]
 - LeetCode: [[https://leetcode.com/problems/power-of-two/][power-of-two/]]
 - Video: [[https://youtube.com/watch?v=H2bjttEV4Vc][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0231-power-of-two.org][My Solution]]
-** TODO 0371. Sum of Two Integers :medium:
-*** Python
+** TODO 0371. Sum of Two Integers :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0371-sum-of-two-integers.py][0371-sum-of-two-integers.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0371-sum-of-two-integers.cpp][0371-sum-of-two-integers.cpp]]
 - LeetCode: [[https://leetcode.com/problems/sum-of-two-integers/][sum-of-two-integers/]]
 - Video: [[https://youtube.com/watch?v=gVUrDV4tZfY][explanation]]
 - Notes: [[../../org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org][My Solution]]
-** TODO 0007. Reverse Integer :medium:
-*** Python
+** TODO 0007. Reverse Integer :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0007-reverse-integer.py][0007-reverse-integer.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0007-reverse-integer.cpp][0007-reverse-integer.cpp]]
 - LeetCode: [[https://leetcode.com/problems/reverse-integer/][reverse-integer/]]
 - Video: [[https://youtube.com/watch?v=HAgLH58IgJQ][explanation]]
@@ -1418,228 +1418,228 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]]
 
 * TODO Math & Geometry [/]
 
-** TODO 0840. Magic Squares In Grid :medium:
-*** Python
+** TODO 0840. Magic Squares In Grid :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0840-magic-squares-in-grid.py][0840-magic-squares-in-grid.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0840-magic-squares-in-grid.cpp][0840-magic-squares-in-grid.cpp]]
 - LeetCode: [[https://leetcode.com/problems/magic-squares-in-grid/][magic-squares-in-grid/]]
 - Video: [[https://youtube.com/watch?v=FV52wWrivNc][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org][My Solution]]
-** TODO 0048. Rotate Image :medium:
-*** Python
+** TODO 0048. Rotate Image :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0048-rotate-image.py][0048-rotate-image.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0048-rotate-image.cpp][0048-rotate-image.cpp]]
 - LeetCode: [[https://leetcode.com/problems/rotate-image/][rotate-image/]]
 - Video: [[https://youtube.com/watch?v=fMSJSS7eO1w][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0048-rotate-image.org][My Solution]]
-** TODO 0054. Spiral Matrix :medium:
-*** Python
+** TODO 0054. Spiral Matrix :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0054-spiral-matrix.py][0054-spiral-matrix.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0054-spiral-matrix.cpp][0054-spiral-matrix.cpp]]
 - LeetCode: [[https://leetcode.com/problems/spiral-matrix/][spiral-matrix/]]
 - Video: [[https://youtube.com/watch?v=BJnMZNwUk1M][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0054-spiral-matrix.org][My Solution]]
-** TODO 2326. Spiral Matrix IV :medium:
-*** Python
+** TODO 2326. Spiral Matrix IV :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2326-spiral-matrix-iv.py][2326-spiral-matrix-iv.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2326-spiral-matrix-iv.cpp][2326-spiral-matrix-iv.cpp]]
 - LeetCode: [[https://leetcode.com/problems/spiral-matrix-iv/][spiral-matrix-iv/]]
 - Video: [[https://youtube.com/watch?v=sOV1nRhmsMQ][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org][My Solution]]
-** TODO 0073. Set Matrix Zeroes :medium:
-*** Python
+** TODO 0073. Set Matrix Zeroes :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0073-set-matrix-zeroes.py][0073-set-matrix-zeroes.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0073-set-matrix-zeroes.cpp][0073-set-matrix-zeroes.cpp]]
 - LeetCode: [[https://leetcode.com/problems/set-matrix-zeroes/][set-matrix-zeroes/]]
 - Video: [[https://youtube.com/watch?v=T41rL0L3Pnw][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org][My Solution]]
-** TODO 0202. Happy Number :easy:
-*** Python
+** TODO 0202. Happy Number :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0202-happy-number.py][0202-happy-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0202-happy-number.cpp][0202-happy-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/happy-number/][happy-number/]]
 - Video: [[https://youtube.com/watch?v=ljz85bxOYJ0][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0202-happy-number.org][My Solution]]
-** TODO 0066. Plus One :easy:
-*** Python
+** TODO 0066. Plus One :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0066-plus-one.py][0066-plus-one.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0066-plus-one.cpp][0066-plus-one.cpp]]
 - LeetCode: [[https://leetcode.com/problems/plus-one/][plus-one/]]
 - Video: [[https://youtube.com/watch?v=jIaA8boiG1s][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0066-plus-one.org][My Solution]]
-** TODO 0009. Palindrome Number :easy:
-*** Python
+** TODO 0009. Palindrome Number :easy: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0009-palindrome-number.py][0009-palindrome-number.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0009-palindrome-number.cpp][0009-palindrome-number.cpp]]
 - LeetCode: [[https://leetcode.com/problems/palindrome-number/][palindrome-number/]]
 - Video: [[https://youtube.com/watch?v=yubRKwixN-U][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0009-palindrome-number.org][My Solution]]
-** TODO 0012. Integer to Roman :medium:
-*** Python
+** TODO 0012. Integer to Roman :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0012-integer-to-roman.py][0012-integer-to-roman.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0012-integer-to-roman.cpp][0012-integer-to-roman.cpp]]
 - LeetCode: [[https://leetcode.com/problems/integer-to-roman/][integer-to-roman/]]
 - Video: [[https://youtube.com/watch?v=ohBNdSJyLh8][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0012-integer-to-roman.org][My Solution]]
-** TODO 0050. Pow(x, n) :medium:
-*** Python
+** TODO 0050. Pow(x, n) :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0050-powx-n.py][0050-powx-n.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0050-powx-n.cpp][0050-powx-n.cpp]]
 - LeetCode: [[https://leetcode.com/problems/powx-n/][powx-n/]]
 - Video: [[https://youtube.com/watch?v=g9YQyYi4IQQ][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0050-powx-n.org][My Solution]]
-** TODO 2698. Find the Punishment Number of an Integer :medium:
-*** Python
+** TODO 2698. Find the Punishment Number of an Integer :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2698-find-the-punishment-number-of-an-integer.py][2698-find-the-punishment-number-of-an-integer.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2698-find-the-punishment-number-of-an-integer.cpp][2698-find-the-punishment-number-of-an-integer.cpp]]
 - LeetCode: [[https://leetcode.com/problems/find-the-punishment-number-of-an-integer/][find-the-punishment-number-of-an-integer/]]
 - Video: [[https://youtube.com/watch?v=LWgksJP-5SA][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org][My Solution]]
-** TODO 1780. Check if Number is a Sum of Powers of Three :medium:
-*** Python
+** TODO 1780. Check if Number is a Sum of Powers of Three :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1780-check-if-number-is-a-sum-of-powers-of-three.py][1780-check-if-number-is-a-sum-of-powers-of-three.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1780-check-if-number-is-a-sum-of-powers-of-three.cpp][1780-check-if-number-is-a-sum-of-powers-of-three.cpp]]
 - LeetCode: [[https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/][check-if-number-is-a-sum-of-powers-of-three/]]
 - Video: [[https://youtube.com/watch?v=99ExTh_0Ycg][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org][My Solution]]
-** TODO 0043. Multiply Strings :medium:
-*** Python
+** TODO 0043. Multiply Strings :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0043-multiply-strings.py][0043-multiply-strings.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0043-multiply-strings.cpp][0043-multiply-strings.cpp]]
 - LeetCode: [[https://leetcode.com/problems/multiply-strings/][multiply-strings/]]
 - Video: [[https://youtube.com/watch?v=1vZswirL8Y8][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0043-multiply-strings.org][My Solution]]
-** TODO 2013. Detect Squares :medium:
-*** Python
+** TODO 2013. Detect Squares :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/2013-detect-squares.py][2013-detect-squares.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/2013-detect-squares.cpp][2013-detect-squares.cpp]]
 - LeetCode: [[https://leetcode.com/problems/detect-squares/][detect-squares/]]
 - Video: [[https://youtube.com/watch?v=bahebearrDc][explanation]]
 - Notes: [[../../org/cpp/dsa/math-geometry/2013-detect-squares.org][My Solution]]
-** TODO 0296. Best Meeting Point :hard:
-*** Python
+** TODO 0296. Best Meeting Point :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0296-best-meeting-point.py][0296-best-meeting-point.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0296-best-meeting-point.cpp][0296-best-meeting-point.cpp]]
 - LeetCode: [[https://leetcode.com/problems/best-meeting-point/][best-meeting-point/]]
 - Notes: [[../../org/cpp/dsa/math-geometry/0296-best-meeting-point.org][My Solution]]
 
 * TODO 2-D Dynamic Programming [/]
 
-** TODO 0062. Unique Paths :medium:
-*** Python
+** TODO 0062. Unique Paths :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0062-unique-paths.py][0062-unique-paths.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0062-unique-paths.cpp][0062-unique-paths.cpp]]
 - LeetCode: [[https://leetcode.com/problems/unique-paths/][unique-paths/]]
 - Video: [[https://youtube.com/watch?v=IlEsdxuD4lY][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org][My Solution]]
-** TODO 1143. Longest Common Subsequence :medium:
-*** Python
+** TODO 1143. Longest Common Subsequence :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1143-longest-common-subsequence.py][1143-longest-common-subsequence.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1143-longest-common-subsequence.cpp][1143-longest-common-subsequence.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-common-subsequence/][longest-common-subsequence/]]
 - Video: [[https://youtube.com/watch?v=Ua0GhsJSlWM][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org][My Solution]]
-** TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
-*** Python
+** TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0309-best-time-to-buy-and-sell-stock-with-cooldown.py][0309-best-time-to-buy-and-sell-stock-with-cooldown.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp][0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp]]
 - LeetCode: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/][best-time-to-buy-and-sell-stock-with-cooldown/]]
 - Video: [[https://youtube.com/watch?v=I7j0F7AHpb8][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org][My Solution]]
-** TODO 0518. Coin Change II :medium:
-*** Python
+** TODO 0518. Coin Change II :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0518-coin-change-ii.py][0518-coin-change-ii.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0518-coin-change-ii.cpp][0518-coin-change-ii.cpp]]
 - LeetCode: [[https://leetcode.com/problems/coin-change-ii/][coin-change-ii/]]
 - Video: [[https://youtube.com/watch?v=Mjy4hd2xgrs][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org][My Solution]]
-** TODO 0494. Target Sum :medium:
-*** Python
+** TODO 0494. Target Sum :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0494-target-sum.py][0494-target-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0494-target-sum.cpp][0494-target-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/target-sum/][target-sum/]]
 - Video: [[https://youtube.com/watch?v=dwMOrl85Xes][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org][My Solution]]
-** TODO 0097. Interleaving String :medium:
-*** Python
+** TODO 0097. Interleaving String :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0097-interleaving-string.py][0097-interleaving-string.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0097-interleaving-string.cpp][0097-interleaving-string.cpp]]
 - LeetCode: [[https://leetcode.com/problems/interleaving-string/][interleaving-string/]]
 - Video: [[https://youtube.com/watch?v=3Rw3p9LrgvE][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org][My Solution]]
-** TODO 0329. Longest Increasing Path In a Matrix :hard:
-*** Python
+** TODO 0329. Longest Increasing Path In a Matrix :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0329-longest-increasing-path-in-a-matrix.py][0329-longest-increasing-path-in-a-matrix.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0329-longest-increasing-path-in-a-matrix.cpp][0329-longest-increasing-path-in-a-matrix.cpp]]
 - LeetCode: [[https://leetcode.com/problems/longest-increasing-path-in-a-matrix/][longest-increasing-path-in-a-matrix/]]
 - Video: [[https://youtube.com/watch?v=wCc_nd-GiEc][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org][My Solution]]
-** TODO 1911. Maximum Alternating Subsequence Sum :medium:
-*** Python
+** TODO 1911. Maximum Alternating Subsequence Sum :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1911-maximum-alternating-subsequence-sum.py][1911-maximum-alternating-subsequence-sum.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1911-maximum-alternating-subsequence-sum.cpp][1911-maximum-alternating-subsequence-sum.cpp]]
 - LeetCode: [[https://leetcode.com/problems/maximum-alternating-subsequence-sum/][maximum-alternating-subsequence-sum/]]
 - Video: [[https://youtube.com/watch?v=4v42XOuU1XA][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org][My Solution]]
-** TODO 0115. Distinct Subsequences :hard:
-*** Python
+** TODO 0115. Distinct Subsequences :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0115-distinct-subsequences.py][0115-distinct-subsequences.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0115-distinct-subsequences.cpp][0115-distinct-subsequences.cpp]]
 - LeetCode: [[https://leetcode.com/problems/distinct-subsequences/][distinct-subsequences/]]
 - Video: [[https://youtube.com/watch?v=-RDzMJ33nx8][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org][My Solution]]
-** TODO 0072. Edit Distance :medium:
-*** Python
+** TODO 0072. Edit Distance :medium: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0072-edit-distance.py][0072-edit-distance.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0072-edit-distance.cpp][0072-edit-distance.cpp]]
 - LeetCode: [[https://leetcode.com/problems/edit-distance/][edit-distance/]]
 - Video: [[https://youtube.com/watch?v=XYi2-LPrwm4][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org][My Solution]]
-** TODO 1220. Count Vowels Permutation :hard:
-*** Python
+** TODO 1220. Count Vowels Permutation :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/1220-count-vowels-permutation.py][1220-count-vowels-permutation.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/1220-count-vowels-permutation.cpp][1220-count-vowels-permutation.cpp]]
 - LeetCode: [[https://leetcode.com/problems/count-vowels-permutation/][count-vowels-permutation/]]
 - Video: [[https://youtube.com/watch?v=VUVpTZVa7Ls][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org][My Solution]]
-** TODO 0312. Burst Balloons :hard:
-*** Python
+** TODO 0312. Burst Balloons :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0312-burst-balloons.py][0312-burst-balloons.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0312-burst-balloons.cpp][0312-burst-balloons.cpp]]
 - LeetCode: [[https://leetcode.com/problems/burst-balloons/][burst-balloons/]]
 - Video: [[https://youtube.com/watch?v=VFskby7lUbw][explanation]]
 - Notes: [[../../org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org][My Solution]]
-** TODO 0010. Regular Expression Matching :hard:
-*** Python
+** TODO 0010. Regular Expression Matching :hard: [/]
+*** TODO Python
 - [[https://github.com/neetcode-gh/leetcode/blob/main/python/0010-regular-expression-matching.py][0010-regular-expression-matching.py]]
-*** C++
+*** TODO C++
 - [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0010-regular-expression-matching.cpp][0010-regular-expression-matching.cpp]]
 - LeetCode: [[https://leetcode.com/problems/regular-expression-matching/][regular-expression-matching/]]
 - Video: [[https://youtube.com/watch?v=HAA8mgxlov8][explanation]]
diff --git a/leetcode/scaffold-notes.mjs b/leetcode/scaffold-notes.mjs
index 0d2f708..f02871e 100644
--- a/leetcode/scaffold-notes.mjs
+++ b/leetcode/scaffold-notes.mjs
@@ -24,7 +24,7 @@ for (const line of roadmap.split("\n")) {
   }
 
   const problemMatch = line.match(
-    /^\*\* TODO (\d+)\. (.+?) :(easy|medium|hard):$/
+    /^\*\* TODO (\d+)\. (.+?) :(easy|medium|hard): \[\/\]$/
   );
   if (problemMatch) {
     const [, num, name, diff] = problemMatch;
@@ -43,6 +43,15 @@ for (const line of roadmap.split("\n")) {
 :NEETCODE: [[${relPath}][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org b/org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
index 3ffbf44..63a481e 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org b/org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
index f19b16c..b22e651 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org b/org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org
index abd604b..db53608 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0091-decode-ways.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org b/org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org
index 232443a..b09bb16 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0139-word-break.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org b/org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
index 82350db..7e2e15f 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org b/org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org
index f842db9..2ebebb6 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0198-house-robber.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org b/org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
index 3ac3c2d..5eaa368 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org b/org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
index ffd0ef9..52479fc 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org b/org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org
index 92b155a..818318f 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0322-coin-change.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org b/org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
index f22dbd9..94ffcb8 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org b/org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
index 61bd6d6..6def8c9 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org b/org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org
index 5fee47c..5b1cdcc 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0656-coin-path.org
+++ b/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
diff --git a/org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org b/org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
index b43afb1..6b9af36 100644
--- a/org/cpp/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org b/org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
index d9ffe57..b8fa75f 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org b/org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org
index 69d4398..de2aa41 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0062-unique-paths.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org b/org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org
index cf4bd04..f8ede60 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0072-edit-distance.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org b/org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org
index 2786196..b74518b 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0097-interleaving-string.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org b/org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
index ee939b4..c81e745 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org b/org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
index b306666..bd61301 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org b/org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org
index 9be65b7..a5751f4 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0312-burst-balloons.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org b/org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
index 046251a..0bebdea 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org b/org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org
index 4c8b5b5..e2a183e 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0494-target-sum.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org b/org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
index 3927cd3..701e854 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/0518-coin-change-ii.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org b/org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
index 6a6bcfe..6515aac 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org b/org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
index 266c81f..e69e654 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org
+++ b/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
diff --git a/org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org b/org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
index 163190a..dbff23a 100644
--- a/org/cpp/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org b/org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org
index 6246cf9..11bde10 100644
--- a/org/cpp/dsa/advanced-graphs/0269-alien-dictionary.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org b/org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org
index eb74e45..06c71bb 100644
--- a/org/cpp/dsa/advanced-graphs/0332-reconstruct-itinerary.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/0743-network-delay-time.org b/org/cpp/dsa/advanced-graphs/0743-network-delay-time.org
index 0077bc7..55103f5 100644
--- a/org/cpp/dsa/advanced-graphs/0743-network-delay-time.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org b/org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org
index e303f61..5f1d55a 100644
--- a/org/cpp/dsa/advanced-graphs/0778-swim-in-rising-water.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org b/org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
index 0693773..f484d2f 100644
--- a/org/cpp/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org b/org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
index d1cd068..c152837 100644
--- a/org/cpp/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org b/org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
index 95f410a..2d189ba 100644
--- a/org/cpp/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org
+++ b/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
diff --git a/org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org b/org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
index 84a728d..ed0419c 100644
--- a/org/cpp/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0001-two-sum.org b/org/cpp/dsa/arrays-hashing/0001-two-sum.org
index 4c3d77b..0dc13e2 100644
--- a/org/cpp/dsa/arrays-hashing/0001-two-sum.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org b/org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org
index 648f024..895b7cd 100644
--- a/org/cpp/dsa/arrays-hashing/0036-valid-sudoku.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org b/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org
index 5833202..9d335de 100644
--- a/org/cpp/dsa/arrays-hashing/0049-group-anagrams.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org b/org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
index cadb8da..15075b8 100644
--- a/org/cpp/dsa/arrays-hashing/0128-longest-consecutive-sequence.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org b/org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org
index c9b009f..77b8eaa 100644
--- a/org/cpp/dsa/arrays-hashing/0217-contains-duplicate.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org b/org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org
index 4e04854..75d9204 100644
--- a/org/cpp/dsa/arrays-hashing/0238-product-of-array-except-self.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0242-valid-anagram.org b/org/cpp/dsa/arrays-hashing/0242-valid-anagram.org
index 887a4b0..1844fca 100644
--- a/org/cpp/dsa/arrays-hashing/0242-valid-anagram.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org b/org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org
index 098bfd2..88ac9dd 100644
--- a/org/cpp/dsa/arrays-hashing/0271-encode-and-decode-strings.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org b/org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org
index 17bad5e..e2ea0c9 100644
--- a/org/cpp/dsa/arrays-hashing/0347-top-k-frequent-elements.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org b/org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org
index 39d38be..bc08a9f 100644
--- a/org/cpp/dsa/arrays-hashing/1408-string-matching-in-an-array.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org b/org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
index bc1c5b8..f9585a8 100644
--- a/org/cpp/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org
+++ b/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
diff --git a/org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org b/org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org
index 563858a..8f2b979 100644
--- a/org/cpp/dsa/arrays-hashing/2678-number-of-senior-citizens.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org b/org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
index ff1d9bc..88c8a52 100644
--- a/org/cpp/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0022-generate-parentheses.org b/org/cpp/dsa/backtracking/0022-generate-parentheses.org
index b08025a..e8f3c37 100644
--- a/org/cpp/dsa/backtracking/0022-generate-parentheses.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0039-combination-sum.org b/org/cpp/dsa/backtracking/0039-combination-sum.org
index e2fbd66..be80a15 100644
--- a/org/cpp/dsa/backtracking/0039-combination-sum.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0040-combination-sum-ii.org b/org/cpp/dsa/backtracking/0040-combination-sum-ii.org
index 9b2a4e7..cd8d29e 100644
--- a/org/cpp/dsa/backtracking/0040-combination-sum-ii.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0046-permutations.org b/org/cpp/dsa/backtracking/0046-permutations.org
index d0e5d28..5cb6b23 100644
--- a/org/cpp/dsa/backtracking/0046-permutations.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0051-n-queens.org b/org/cpp/dsa/backtracking/0051-n-queens.org
index f5fe332..13f2c56 100644
--- a/org/cpp/dsa/backtracking/0051-n-queens.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0052-n-queens-ii.org b/org/cpp/dsa/backtracking/0052-n-queens-ii.org
index 1f90c80..fe66d8a 100644
--- a/org/cpp/dsa/backtracking/0052-n-queens-ii.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0077-combinations.org b/org/cpp/dsa/backtracking/0077-combinations.org
index 66ee6b5..20e2dd9 100644
--- a/org/cpp/dsa/backtracking/0077-combinations.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0078-subsets.org b/org/cpp/dsa/backtracking/0078-subsets.org
index 7070453..9c3050d 100644
--- a/org/cpp/dsa/backtracking/0078-subsets.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0079-word-search.org b/org/cpp/dsa/backtracking/0079-word-search.org
index d4e145b..63ffdf9 100644
--- a/org/cpp/dsa/backtracking/0079-word-search.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0090-subsets-ii.org b/org/cpp/dsa/backtracking/0090-subsets-ii.org
index 087fe40..a82df28 100644
--- a/org/cpp/dsa/backtracking/0090-subsets-ii.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0131-palindrome-partitioning.org b/org/cpp/dsa/backtracking/0131-palindrome-partitioning.org
index 4291296..2e12aab 100644
--- a/org/cpp/dsa/backtracking/0131-palindrome-partitioning.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/0351-android-unlock-patterns.org b/org/cpp/dsa/backtracking/0351-android-unlock-patterns.org
index bb94cbb..3c99e20 100644
--- a/org/cpp/dsa/backtracking/0351-android-unlock-patterns.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org b/org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org
index cf53d89..e156300 100644
--- a/org/cpp/dsa/backtracking/1079-letter-tile-possibilities.org
+++ b/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
diff --git a/org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org b/org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
index 6a01d56..62619cb 100644
--- a/org/cpp/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org b/org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org
index 1411aff..506a254 100644
--- a/org/cpp/dsa/binary-search/0004-median-of-two-sorted-arrays.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org b/org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org
index 91b0869..a40e62b 100644
--- a/org/cpp/dsa/binary-search/0033-search-in-rotated-sorted-array.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org b/org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org
index e97512c..c790b87 100644
--- a/org/cpp/dsa/binary-search/0074-search-a-2d-matrix.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org b/org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
index d4cdb76..9ae3cae 100644
--- a/org/cpp/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0704-binary-search.org b/org/cpp/dsa/binary-search/0704-binary-search.org
index 8ca8a3e..df28a5b 100644
--- a/org/cpp/dsa/binary-search/0704-binary-search.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org b/org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
index 0205e46..264b759 100644
--- a/org/cpp/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0875-koko-eating-bananas.org b/org/cpp/dsa/binary-search/0875-koko-eating-bananas.org
index 76ec1e3..dc32e83 100644
--- a/org/cpp/dsa/binary-search/0875-koko-eating-bananas.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/0981-time-based-key-value-store.org b/org/cpp/dsa/binary-search/0981-time-based-key-value-store.org
index b8af3a4..8e1cc1b 100644
--- a/org/cpp/dsa/binary-search/0981-time-based-key-value-store.org
+++ b/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
diff --git a/org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org b/org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
index ca05c65..7f06623 100644
--- a/org/cpp/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0007-reverse-integer.org b/org/cpp/dsa/bit-manipulation/0007-reverse-integer.org
index e64173c..a9b3482 100644
--- a/org/cpp/dsa/bit-manipulation/0007-reverse-integer.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0136-single-number.org b/org/cpp/dsa/bit-manipulation/0136-single-number.org
index 28b52dd..08d6de1 100644
--- a/org/cpp/dsa/bit-manipulation/0136-single-number.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0190-reverse-bits.org b/org/cpp/dsa/bit-manipulation/0190-reverse-bits.org
index ee98cd4..8d7c15a 100644
--- a/org/cpp/dsa/bit-manipulation/0190-reverse-bits.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org b/org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org
index ccd3906..c58bcfc 100644
--- a/org/cpp/dsa/bit-manipulation/0191-number-of-1-bits.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0231-power-of-two.org b/org/cpp/dsa/bit-manipulation/0231-power-of-two.org
index 336b739..0fc6e0c 100644
--- a/org/cpp/dsa/bit-manipulation/0231-power-of-two.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0260-single-number-iii.org b/org/cpp/dsa/bit-manipulation/0260-single-number-iii.org
index 851dfa1..0e9e0b9 100644
--- a/org/cpp/dsa/bit-manipulation/0260-single-number-iii.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0268-missing-number.org b/org/cpp/dsa/bit-manipulation/0268-missing-number.org
index f488de6..df3f956 100644
--- a/org/cpp/dsa/bit-manipulation/0268-missing-number.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0338-counting-bits.org b/org/cpp/dsa/bit-manipulation/0338-counting-bits.org
index 3740852..d7fe7e6 100644
--- a/org/cpp/dsa/bit-manipulation/0338-counting-bits.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org b/org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org
index 5e9629a..c638d42 100644
--- a/org/cpp/dsa/bit-manipulation/0371-sum-of-two-integers.org
+++ b/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
diff --git a/org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org b/org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
index 7db219e..e4b38e3 100644
--- a/org/cpp/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0127-word-ladder.org b/org/cpp/dsa/graphs/0127-word-ladder.org
index ecfb309..6a0ac67 100644
--- a/org/cpp/dsa/graphs/0127-word-ladder.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0130-surrounded-regions.org b/org/cpp/dsa/graphs/0130-surrounded-regions.org
index 9ad1589..b036229 100644
--- a/org/cpp/dsa/graphs/0130-surrounded-regions.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0133-clone-graph.org b/org/cpp/dsa/graphs/0133-clone-graph.org
index 30f2101..785bfc6 100644
--- a/org/cpp/dsa/graphs/0133-clone-graph.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0200-number-of-islands.org b/org/cpp/dsa/graphs/0200-number-of-islands.org
index 18bbeab..71d1212 100644
--- a/org/cpp/dsa/graphs/0200-number-of-islands.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0207-course-schedule.org b/org/cpp/dsa/graphs/0207-course-schedule.org
index d6e82f9..3b7d601 100644
--- a/org/cpp/dsa/graphs/0207-course-schedule.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0210-course-schedule-ii.org b/org/cpp/dsa/graphs/0210-course-schedule-ii.org
index f189045..f5e5794 100644
--- a/org/cpp/dsa/graphs/0210-course-schedule-ii.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0261-graph-valid-tree.org b/org/cpp/dsa/graphs/0261-graph-valid-tree.org
index 5b81170..46a6468 100644
--- a/org/cpp/dsa/graphs/0261-graph-valid-tree.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0286-walls-and-gates.org b/org/cpp/dsa/graphs/0286-walls-and-gates.org
index 8745781..b8a9093 100644
--- a/org/cpp/dsa/graphs/0286-walls-and-gates.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org b/org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
index 201b110..1dfb23b 100644
--- a/org/cpp/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org b/org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org
index f586b13..ff7196b 100644
--- a/org/cpp/dsa/graphs/0417-pacific-atlantic-water-flow.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0684-redundant-connection.org b/org/cpp/dsa/graphs/0684-redundant-connection.org
index ca0b0a7..ffd4ba4 100644
--- a/org/cpp/dsa/graphs/0684-redundant-connection.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0695-max-area-of-island.org b/org/cpp/dsa/graphs/0695-max-area-of-island.org
index 624d989..3a6257a 100644
--- a/org/cpp/dsa/graphs/0695-max-area-of-island.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0802-find-eventual-safe-states.org b/org/cpp/dsa/graphs/0802-find-eventual-safe-states.org
index 69b6d5e..bfa516b 100644
--- a/org/cpp/dsa/graphs/0802-find-eventual-safe-states.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/0994-rotting-oranges.org b/org/cpp/dsa/graphs/0994-rotting-oranges.org
index 5a93418..2b55d15 100644
--- a/org/cpp/dsa/graphs/0994-rotting-oranges.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/1905-count-sub-islands.org b/org/cpp/dsa/graphs/1905-count-sub-islands.org
index ef335ac..2165983 100644
--- a/org/cpp/dsa/graphs/1905-count-sub-islands.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/2092-find-all-people-with-secret.org b/org/cpp/dsa/graphs/2092-find-all-people-with-secret.org
index 79c3cdc..feb1ef8 100644
--- a/org/cpp/dsa/graphs/2092-find-all-people-with-secret.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org b/org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
index 3ba7a6d..d0652dd 100644
--- a/org/cpp/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org
+++ b/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
diff --git a/org/cpp/dsa/graphs/2924-find-champion-ii.org b/org/cpp/dsa/graphs/2924-find-champion-ii.org
index 68b63fe..84da789 100644
--- a/org/cpp/dsa/graphs/2924-find-champion-ii.org
+++ b/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
diff --git a/org/cpp/dsa/greedy/0045-jump-game-ii.org b/org/cpp/dsa/greedy/0045-jump-game-ii.org
index 324e4a7..f0c8af9 100644
--- a/org/cpp/dsa/greedy/0045-jump-game-ii.org
+++ b/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
diff --git a/org/cpp/dsa/greedy/0053-maximum-subarray.org b/org/cpp/dsa/greedy/0053-maximum-subarray.org
index 605affb..6dab6e9 100644
--- a/org/cpp/dsa/greedy/0053-maximum-subarray.org
+++ b/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
diff --git a/org/cpp/dsa/greedy/0055-jump-game.org b/org/cpp/dsa/greedy/0055-jump-game.org
index 20d6f00..a209e58 100644
--- a/org/cpp/dsa/greedy/0055-jump-game.org
+++ b/org/cpp/dsa/greedy/0055-jump-game.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0055. Jump Game][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0134-gas-station.org b/org/cpp/dsa/greedy/0134-gas-station.org
index f3b9137..75c17de 100644
--- a/org/cpp/dsa/greedy/0134-gas-station.org
+++ b/org/cpp/dsa/greedy/0134-gas-station.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0134. Gas Station][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org b/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org
index e02bb28..07b48a9 100644
--- a/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org
+++ b/org/cpp/dsa/greedy/0678-valid-parenthesis-string.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0678. Valid Parenthesis String][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0763-partition-labels.org b/org/cpp/dsa/greedy/0763-partition-labels.org
index ead0a4b..e78a208 100644
--- a/org/cpp/dsa/greedy/0763-partition-labels.org
+++ b/org/cpp/dsa/greedy/0763-partition-labels.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0763. Partition Labels][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0846-hand-of-straights.org b/org/cpp/dsa/greedy/0846-hand-of-straights.org
index d0a3e08..e2b9283 100644
--- a/org/cpp/dsa/greedy/0846-hand-of-straights.org
+++ b/org/cpp/dsa/greedy/0846-hand-of-straights.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0846. Hand of Straights][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org b/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
index 7f2fcf3..d8ecb44 100644
--- a/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
+++ b/org/cpp/dsa/greedy/0945-minimum-increment-to-make-array-unique.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org b/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org
index 9a36c2b..947be2b 100644
--- a/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org
+++ b/org/cpp/dsa/greedy/0978-longest-turbulent-subarray.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/1871-jump-game-vii.org b/org/cpp/dsa/greedy/1871-jump-game-vii.org
index fbec914..1bfbc6d 100644
--- a/org/cpp/dsa/greedy/1871-jump-game-vii.org
+++ b/org/cpp/dsa/greedy/1871-jump-game-vii.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1871. Jump Game VII][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org b/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
index 62be7d2..b951c5d 100644
--- a/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
+++ b/org/cpp/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org b/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
index 1775574..d4e01be 100644
--- a/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
+++ b/org/cpp/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0215. Kth Largest Element 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
diff --git a/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org b/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
index c24c977..db809b0 100644
--- a/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
+++ b/org/cpp/dsa/heap-priority-queue/0295-find-median-from-data-stream.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0295. Find Median From Data Stream][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org b/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org
index 978065c..777a9d5 100644
--- a/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org
+++ b/org/cpp/dsa/heap-priority-queue/0355-design-twitter.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0355. Design Twitter][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org b/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org
index f1548df..8c1646d 100644
--- a/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org
+++ b/org/cpp/dsa/heap-priority-queue/0621-task-scheduler.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0621. Task Scheduler][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org b/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
index 2610954..9484df2 100644
--- a/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
+++ b/org/cpp/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org b/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
index 64e3dcf..762b88d 100644
--- a/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
+++ b/org/cpp/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0973. K Closest Points to Origin][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org b/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org
index 34bc465..b522aca 100644
--- a/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org
+++ b/org/cpp/dsa/heap-priority-queue/1046-last-stone-weight.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1046. Last Stone Weight][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0056-merge-intervals.org b/org/cpp/dsa/intervals/0056-merge-intervals.org
index f0bf04d..bd2cf32 100644
--- a/org/cpp/dsa/intervals/0056-merge-intervals.org
+++ b/org/cpp/dsa/intervals/0056-merge-intervals.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0056. Merge Intervals][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0057-insert-interval.org b/org/cpp/dsa/intervals/0057-insert-interval.org
index 9088150..dea85a2 100644
--- a/org/cpp/dsa/intervals/0057-insert-interval.org
+++ b/org/cpp/dsa/intervals/0057-insert-interval.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0057. Insert Interval][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0252-meeting-rooms.org b/org/cpp/dsa/intervals/0252-meeting-rooms.org
index fa78404..182a5f7 100644
--- a/org/cpp/dsa/intervals/0252-meeting-rooms.org
+++ b/org/cpp/dsa/intervals/0252-meeting-rooms.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0252. Meeting Rooms][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org b/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org
index b74e5d4..99728db 100644
--- a/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org
+++ b/org/cpp/dsa/intervals/0253-meeting-rooms-ii.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0253. Meeting Rooms II][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org b/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org
index 4b9172c..1eece6a 100644
--- a/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org
+++ b/org/cpp/dsa/intervals/0435-non-overlapping-intervals.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0435. Non Overlapping Intervals][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/0986-interval-list-intersections.org b/org/cpp/dsa/intervals/0986-interval-list-intersections.org
index 9417e6b..68b2386 100644
--- a/org/cpp/dsa/intervals/0986-interval-list-intersections.org
+++ b/org/cpp/dsa/intervals/0986-interval-list-intersections.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0986. Interval List Intersections][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org b/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org
index 9c16217..4f00042 100644
--- a/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org
+++ b/org/cpp/dsa/intervals/1851-minimum-interval-to-include-each-query.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0002-add-two-numbers.org b/org/cpp/dsa/linked-list/0002-add-two-numbers.org
index 8f8b86f..2a466aa 100644
--- a/org/cpp/dsa/linked-list/0002-add-two-numbers.org
+++ b/org/cpp/dsa/linked-list/0002-add-two-numbers.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0002. Add Two Numbers][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org b/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
index dc6a672..a94d1fa 100644
--- a/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
+++ b/org/cpp/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org b/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org
index 09c6cfc..0825bde 100644
--- a/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org
+++ b/org/cpp/dsa/linked-list/0021-merge-two-sorted-lists.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org b/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org
index 10e10d8..6197b45 100644
--- a/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org
+++ b/org/cpp/dsa/linked-list/0023-merge-k-sorted-lists.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0023. Merge K Sorted Lists][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org b/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org
index 3c9da4e..d7d13da 100644
--- a/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org
+++ b/org/cpp/dsa/linked-list/0025-reverse-nodes-in-k-group.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org b/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org
index 4c83212..f11442b 100644
--- a/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org
+++ b/org/cpp/dsa/linked-list/0138-copy-list-with-random-pointer.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0138. Copy List With Random Pointer][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0141-linked-list-cycle.org b/org/cpp/dsa/linked-list/0141-linked-list-cycle.org
index 69ac72c..f30f655 100644
--- a/org/cpp/dsa/linked-list/0141-linked-list-cycle.org
+++ b/org/cpp/dsa/linked-list/0141-linked-list-cycle.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0141. Linked List Cycle][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0143-reorder-list.org b/org/cpp/dsa/linked-list/0143-reorder-list.org
index 8023761..4a60ef6 100644
--- a/org/cpp/dsa/linked-list/0143-reorder-list.org
+++ b/org/cpp/dsa/linked-list/0143-reorder-list.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0143. Reorder List][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0146-lru-cache.org b/org/cpp/dsa/linked-list/0146-lru-cache.org
index 448cbb8..b055fe3 100644
--- a/org/cpp/dsa/linked-list/0146-lru-cache.org
+++ b/org/cpp/dsa/linked-list/0146-lru-cache.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0146. LRU Cache][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0206-reverse-linked-list.org b/org/cpp/dsa/linked-list/0206-reverse-linked-list.org
index 8087d74..808a4dd 100644
--- a/org/cpp/dsa/linked-list/0206-reverse-linked-list.org
+++ b/org/cpp/dsa/linked-list/0206-reverse-linked-list.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0206. Reverse Linked List][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org b/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org
index cb79995..e2b327b 100644
--- a/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org
+++ b/org/cpp/dsa/linked-list/0287-find-the-duplicate-number.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0287. Find The Duplicate Number][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org b/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org
index 1eb8c8b..37ab070 100644
--- a/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org
+++ b/org/cpp/dsa/linked-list/0725-split-linked-list-in-parts.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0725. Split Linked List in Parts][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/1472-design-browser-history.org b/org/cpp/dsa/linked-list/1472-design-browser-history.org
index 2d35c06..c470404 100644
--- a/org/cpp/dsa/linked-list/1472-design-browser-history.org
+++ b/org/cpp/dsa/linked-list/1472-design-browser-history.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1472. Design Browser History][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org b/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
index 0cccfb7..e2c92a8 100644
--- a/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
+++ b/org/cpp/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org b/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org
index 05d8688..94fae98 100644
--- a/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org
+++ b/org/cpp/dsa/linked-list/2487-remove-nodes-from-linked-list.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0009-palindrome-number.org b/org/cpp/dsa/math-geometry/0009-palindrome-number.org
index 80f534b..d6c9f54 100644
--- a/org/cpp/dsa/math-geometry/0009-palindrome-number.org
+++ b/org/cpp/dsa/math-geometry/0009-palindrome-number.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0009. Palindrome Number][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0012-integer-to-roman.org b/org/cpp/dsa/math-geometry/0012-integer-to-roman.org
index 45a6a96..e846dbf 100644
--- a/org/cpp/dsa/math-geometry/0012-integer-to-roman.org
+++ b/org/cpp/dsa/math-geometry/0012-integer-to-roman.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0012. Integer to Roman][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0043-multiply-strings.org b/org/cpp/dsa/math-geometry/0043-multiply-strings.org
index df00655..cf41df3 100644
--- a/org/cpp/dsa/math-geometry/0043-multiply-strings.org
+++ b/org/cpp/dsa/math-geometry/0043-multiply-strings.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0043. Multiply Strings][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0048-rotate-image.org b/org/cpp/dsa/math-geometry/0048-rotate-image.org
index a731278..571630a 100644
--- a/org/cpp/dsa/math-geometry/0048-rotate-image.org
+++ b/org/cpp/dsa/math-geometry/0048-rotate-image.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0048. Rotate Image][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0050-pow-x-n.org b/org/cpp/dsa/math-geometry/0050-pow-x-n.org
index ca0a6e4..7e2c4cc 100644
--- a/org/cpp/dsa/math-geometry/0050-pow-x-n.org
+++ b/org/cpp/dsa/math-geometry/0050-pow-x-n.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0050. Pow(x, n)][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0054-spiral-matrix.org b/org/cpp/dsa/math-geometry/0054-spiral-matrix.org
index f76e352..ac02832 100644
--- a/org/cpp/dsa/math-geometry/0054-spiral-matrix.org
+++ b/org/cpp/dsa/math-geometry/0054-spiral-matrix.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0054. Spiral Matrix][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0066-plus-one.org b/org/cpp/dsa/math-geometry/0066-plus-one.org
index 2ee2cb0..4f07184 100644
--- a/org/cpp/dsa/math-geometry/0066-plus-one.org
+++ b/org/cpp/dsa/math-geometry/0066-plus-one.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0066. Plus One][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org b/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org
index 0ed5626..655b79d 100644
--- a/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org
+++ b/org/cpp/dsa/math-geometry/0073-set-matrix-zeroes.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0073. Set Matrix Zeroes][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0202-happy-number.org b/org/cpp/dsa/math-geometry/0202-happy-number.org
index bff38b4..125bcbd 100644
--- a/org/cpp/dsa/math-geometry/0202-happy-number.org
+++ b/org/cpp/dsa/math-geometry/0202-happy-number.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0202. Happy Number][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0296-best-meeting-point.org b/org/cpp/dsa/math-geometry/0296-best-meeting-point.org
index 1d978f9..918528b 100644
--- a/org/cpp/dsa/math-geometry/0296-best-meeting-point.org
+++ b/org/cpp/dsa/math-geometry/0296-best-meeting-point.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0296. Best Meeting Point][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org b/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org
index 04faddb..2809f47 100644
--- a/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org
+++ b/org/cpp/dsa/math-geometry/0840-magic-squares-in-grid.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0840. Magic Squares In Grid][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org b/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
index c8ff2cf..f94f4cf 100644
--- a/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
+++ b/org/cpp/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/2013-detect-squares.org b/org/cpp/dsa/math-geometry/2013-detect-squares.org
index d73be23..4cf8bee 100644
--- a/org/cpp/dsa/math-geometry/2013-detect-squares.org
+++ b/org/cpp/dsa/math-geometry/2013-detect-squares.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2013. Detect Squares][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org b/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org
index 4aa59c5..3800a8f 100644
--- a/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org
+++ b/org/cpp/dsa/math-geometry/2326-spiral-matrix-iv.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2326. Spiral Matrix IV][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org b/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
index c839f05..c886591 100644
--- a/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
+++ b/org/cpp/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org b/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
index 83a2749..e5c9147 100644
--- a/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
+++ b/org/cpp/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org b/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org
index ee0a5ca..e8906a4 100644
--- a/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org
+++ b/org/cpp/dsa/sliding-window/0076-minimum-window-substring.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0076. Minimum Window Substring][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org b/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
index a254a2b..fc4f48c 100644
--- a/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
+++ b/org/cpp/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org b/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org
index 4430980..4634c45 100644
--- a/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org
+++ b/org/cpp/dsa/sliding-window/0239-sliding-window-maximum.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0239. Sliding Window Maximum][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org b/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org
index 37ccd1f..5628c25 100644
--- a/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org
+++ b/org/cpp/dsa/sliding-window/0424-longest-repeating-character-replacement.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/0567-permutation-in-string.org b/org/cpp/dsa/sliding-window/0567-permutation-in-string.org
index 4040de7..53d4051 100644
--- a/org/cpp/dsa/sliding-window/0567-permutation-in-string.org
+++ b/org/cpp/dsa/sliding-window/0567-permutation-in-string.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0567. Permutation In String][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org b/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
index 2ef4bba..0c583fe 100644
--- a/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
+++ b/org/cpp/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0020-valid-parentheses.org b/org/cpp/dsa/stack/0020-valid-parentheses.org
index 04d44b7..2ce9cf4 100644
--- a/org/cpp/dsa/stack/0020-valid-parentheses.org
+++ b/org/cpp/dsa/stack/0020-valid-parentheses.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0020. Valid Parentheses][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org b/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org
index d78205a..e89d23b 100644
--- a/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org
+++ b/org/cpp/dsa/stack/0084-largest-rectangle-in-histogram.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org b/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org
index 8d8c2e0..bb171b5 100644
--- a/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org
+++ b/org/cpp/dsa/stack/0150-evaluate-reverse-polish-notation.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0155-min-stack.org b/org/cpp/dsa/stack/0155-min-stack.org
index 5e865d3..341ca08 100644
--- a/org/cpp/dsa/stack/0155-min-stack.org
+++ b/org/cpp/dsa/stack/0155-min-stack.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0155. Min Stack][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0682-baseball-game.org b/org/cpp/dsa/stack/0682-baseball-game.org
index 97159a9..6b38958 100644
--- a/org/cpp/dsa/stack/0682-baseball-game.org
+++ b/org/cpp/dsa/stack/0682-baseball-game.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0682. Baseball Game][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0726-number-of-atoms.org b/org/cpp/dsa/stack/0726-number-of-atoms.org
index 80eaca8..5c3e099 100644
--- a/org/cpp/dsa/stack/0726-number-of-atoms.org
+++ b/org/cpp/dsa/stack/0726-number-of-atoms.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0726. Number of Atoms][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0739-daily-temperatures.org b/org/cpp/dsa/stack/0739-daily-temperatures.org
index 41f1a16..7a71930 100644
--- a/org/cpp/dsa/stack/0739-daily-temperatures.org
+++ b/org/cpp/dsa/stack/0739-daily-temperatures.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0739. Daily Temperatures][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0853-car-fleet.org b/org/cpp/dsa/stack/0853-car-fleet.org
index a8a69d4..de6a4e2 100644
--- a/org/cpp/dsa/stack/0853-car-fleet.org
+++ b/org/cpp/dsa/stack/0853-car-fleet.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0853. Car Fleet][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/0901-online-stock-span.org b/org/cpp/dsa/stack/0901-online-stock-span.org
index 588e723..a65c3cc 100644
--- a/org/cpp/dsa/stack/0901-online-stock-span.org
+++ b/org/cpp/dsa/stack/0901-online-stock-span.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0901. Online Stock Span][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/stack/1544-make-the-string-great.org b/org/cpp/dsa/stack/1544-make-the-string-great.org
index 9dfa56c..c1a486d 100644
--- a/org/cpp/dsa/stack/1544-make-the-string-great.org
+++ b/org/cpp/dsa/stack/1544-make-the-string-great.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1544. Make The String Great][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0098-validate-binary-search-tree.org b/org/cpp/dsa/trees/0098-validate-binary-search-tree.org
index 2c46e58..545290a 100644
--- a/org/cpp/dsa/trees/0098-validate-binary-search-tree.org
+++ b/org/cpp/dsa/trees/0098-validate-binary-search-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0098. Validate Binary Search Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0100-same-tree.org b/org/cpp/dsa/trees/0100-same-tree.org
index fe69ec0..7f8b448 100644
--- a/org/cpp/dsa/trees/0100-same-tree.org
+++ b/org/cpp/dsa/trees/0100-same-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0100. Same Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org b/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org
index b89af92..9b312a4 100644
--- a/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org
+++ b/org/cpp/dsa/trees/0102-binary-tree-level-order-traversal.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org b/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org
index 561508e..d5cd7f2 100644
--- a/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org
+++ b/org/cpp/dsa/trees/0104-maximum-depth-of-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org b/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
index 1d0a249..db97a5d 100644
--- a/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
+++ b/org/cpp/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0110-balanced-binary-tree.org b/org/cpp/dsa/trees/0110-balanced-binary-tree.org
index 6edd0cb..297e312 100644
--- a/org/cpp/dsa/trees/0110-balanced-binary-tree.org
+++ b/org/cpp/dsa/trees/0110-balanced-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0110. Balanced Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org b/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org
index d8811b2..ce1e03d 100644
--- a/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org
+++ b/org/cpp/dsa/trees/0124-binary-tree-maximum-path-sum.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org b/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org
index 453eaf7..944ad67 100644
--- a/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org
+++ b/org/cpp/dsa/trees/0199-binary-tree-right-side-view.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0199. Binary Tree Right Side View][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0226-invert-binary-tree.org b/org/cpp/dsa/trees/0226-invert-binary-tree.org
index b8b673c..c8ca496 100644
--- a/org/cpp/dsa/trees/0226-invert-binary-tree.org
+++ b/org/cpp/dsa/trees/0226-invert-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0226. Invert Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org b/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org
index 738852e..b6685c8 100644
--- a/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org
+++ b/org/cpp/dsa/trees/0230-kth-smallest-element-in-a-bst.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org b/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
index 23a96a8..3160d65 100644
--- a/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
+++ b/org/cpp/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org b/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
index 8f6f1c2..f8511ea 100644
--- a/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
+++ b/org/cpp/dsa/trees/0297-serialize-and-deserialize-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org b/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org
index a8e2df8..5d6d0a1 100644
--- a/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org
+++ b/org/cpp/dsa/trees/0543-diameter-of-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0543. Diameter of Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0572-subtree-of-another-tree.org b/org/cpp/dsa/trees/0572-subtree-of-another-tree.org
index df1e52e..28f9c09 100644
--- a/org/cpp/dsa/trees/0572-subtree-of-another-tree.org
+++ b/org/cpp/dsa/trees/0572-subtree-of-another-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0572. Subtree of Another Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org b/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org
index 403c421..0608c80 100644
--- a/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org
+++ b/org/cpp/dsa/trees/0590-n-ary-tree-postorder-traversal.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org b/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
index 49c0ced..a97a376 100644
--- a/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
+++ b/org/cpp/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org b/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org
index c7e9725..1e6b160 100644
--- a/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org
+++ b/org/cpp/dsa/trees/1376-time-needed-to-inform-all-employees.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org b/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org
index 4b8705e..5310bcd 100644
--- a/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org
+++ b/org/cpp/dsa/trees/1448-count-good-nodes-in-binary-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org b/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org
index 2b2e0b9..3b81e3b 100644
--- a/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org
+++ b/org/cpp/dsa/tries/0208-implement-trie-prefix-tree.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org b/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org
index babfba4..e78e8ba 100644
--- a/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org
+++ b/org/cpp/dsa/tries/0211-design-add-and-search-words-data-structure.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/tries/0212-word-search-ii.org b/org/cpp/dsa/tries/0212-word-search-ii.org
index 557142a..30d7cdc 100644
--- a/org/cpp/dsa/tries/0212-word-search-ii.org
+++ b/org/cpp/dsa/tries/0212-word-search-ii.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0212. Word Search II][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/tries/1166-design-file-system.org b/org/cpp/dsa/tries/1166-design-file-system.org
index ee138a5..90992f9 100644
--- a/org/cpp/dsa/tries/1166-design-file-system.org
+++ b/org/cpp/dsa/tries/1166-design-file-system.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*1166. Design File System][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0011-container-with-most-water.org b/org/cpp/dsa/two-pointers/0011-container-with-most-water.org
index ea0b17e..a431d63 100644
--- a/org/cpp/dsa/two-pointers/0011-container-with-most-water.org
+++ b/org/cpp/dsa/two-pointers/0011-container-with-most-water.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0011. Container With Most Water][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0015-3sum.org b/org/cpp/dsa/two-pointers/0015-3sum.org
index 6b9444b..6135784 100644
--- a/org/cpp/dsa/two-pointers/0015-3sum.org
+++ b/org/cpp/dsa/two-pointers/0015-3sum.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0015. 3Sum][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org b/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org
index 9a6d18c..12aa12a 100644
--- a/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org
+++ b/org/cpp/dsa/two-pointers/0042-trapping-rain-water.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0042. Trapping Rain Water][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0125-valid-palindrome.org b/org/cpp/dsa/two-pointers/0125-valid-palindrome.org
index e6a7a0d..b92c51c 100644
--- a/org/cpp/dsa/two-pointers/0125-valid-palindrome.org
+++ b/org/cpp/dsa/two-pointers/0125-valid-palindrome.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0125. Valid Palindrome][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org b/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
index b427698..fa17c4b 100644
--- a/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
+++ b/org/cpp/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0259-3sum-smaller.org b/org/cpp/dsa/two-pointers/0259-3sum-smaller.org
index f81fa7e..76ba1cd 100644
--- a/org/cpp/dsa/two-pointers/0259-3sum-smaller.org
+++ b/org/cpp/dsa/two-pointers/0259-3sum-smaller.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0259. 3Sum Smaller][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src
diff --git a/org/cpp/dsa/two-pointers/0344-reverse-string.org b/org/cpp/dsa/two-pointers/0344-reverse-string.org
index 426350a..5c0ff0b 100644
--- a/org/cpp/dsa/two-pointers/0344-reverse-string.org
+++ b/org/cpp/dsa/two-pointers/0344-reverse-string.org
@@ -3,6 +3,15 @@
 :NEETCODE: [[../../../../leetcode/out/roadmap.org::*0344. Reverse String][Roadmap]]
 :END:
 
+** TODO Approach
+Write your approach here.
+
+** TODO Python
+#+begin_src python
+
+#+end_src
+
+** TODO C++
 #+begin_src cpp
 
 #+end_src