From d674451070a600a53cf8a7966beb6d3b2eaaa798 Mon Sep 17 00:00:00 2001 From: Wong Ding Feng Date: Mon, 1 Jun 2026 17:06:27 +0800 Subject: [PATCH] fix: add file: prefix to org-mode links for Emacs resolution Emorg org-mode requires [[file:path]] syntax for file links to be clickable. Updated both extract.mjs and scaffold-notes.mjs generators, and fixed all 200 existing note files. --- leetcode/AGENTS.md | 2 +- leetcode/extract.mjs | 2 +- leetcode/scaffold-notes.mjs | 2 +- .../0005-longest-palindromic-substring.org | 2 +- .../0070-climbing-stairs.org | 2 +- .../0091-decode-ways.org | 2 +- .../0139-word-break.org | 2 +- .../0152-maximum-product-subarray.org | 2 +- .../0198-house-robber.org | 2 +- .../0213-house-robber-ii.org | 2 +- .../0300-longest-increasing-subsequence.org | 2 +- .../0322-coin-change.org | 2 +- .../0416-partition-equal-subset-sum.org | 2 +- .../0647-palindromic-substrings.org | 2 +- .../0656-coin-path.org | 2 +- .../0746-min-cost-climbing-stairs.org | 2 +- .../0010-regular-expression-matching.org | 2 +- .../0062-unique-paths.org | 2 +- .../0072-edit-distance.org | 2 +- .../0097-interleaving-string.org | 2 +- .../0115-distinct-subsequences.org | 2 +- ...me-to-buy-and-sell-stock-with-cooldown.org | 2 +- .../0312-burst-balloons.org | 2 +- ...29-longest-increasing-path-in-a-matrix.org | 2 +- .../0494-target-sum.org | 2 +- .../0518-coin-change-ii.org | 2 +- .../1143-longest-common-subsequence.org | 2 +- .../1220-count-vowels-permutation.org | 2 +- ...11-maximum-alternating-subsequence-sum.org | 2 +- .../advanced-graphs/0269-alien-dictionary.org | 2 +- .../0332-reconstruct-itinerary.org | 2 +- .../0743-network-delay-time.org | 2 +- .../0778-swim-in-rising-water.org | 2 +- .../0787-cheapest-flights-within-k-stops.org | 2 +- .../1584-min-cost-to-connect-all-points.org | 2 +- ...odes-into-the-maximum-number-of-groups.org | 2 +- .../2812-find-the-safest-path-in-a-grid.org | 2 +- .../dsa/arrays-hashing/0001-two-sum.org | 2 +- .../dsa/arrays-hashing/0036-valid-sudoku.org | 2 +- .../arrays-hashing/0049-group-anagrams.org | 2 +- .../0128-longest-consecutive-sequence.org | 2 +- .../0217-contains-duplicate.org | 2 +- .../0238-product-of-array-except-self.org | 2 +- .../dsa/arrays-hashing/0242-valid-anagram.org | 2 +- .../0271-encode-and-decode-strings.org | 2 +- .../0347-top-k-frequent-elements.org | 2 +- .../1408-string-matching-in-an-array.org | 2 +- ...erations-to-move-all-balls-to-each-box.org | 2 +- .../2678-number-of-senior-citizens.org | 2 +- ...-letter-combinations-of-a-phone-number.org | 2 +- .../0022-generate-parentheses.org | 2 +- .../dsa/backtracking/0039-combination-sum.org | 2 +- .../backtracking/0040-combination-sum-ii.org | 2 +- .../dsa/backtracking/0046-permutations.org | 2 +- .../dsa/backtracking/0051-n-queens.org | 2 +- .../dsa/backtracking/0052-n-queens-ii.org | 2 +- .../dsa/backtracking/0077-combinations.org | 2 +- .../dsa/backtracking/0078-subsets.org | 2 +- .../dsa/backtracking/0079-word-search.org | 2 +- .../dsa/backtracking/0090-subsets-ii.org | 2 +- .../0131-palindrome-partitioning.org | 2 +- .../0351-android-unlock-patterns.org | 2 +- .../1079-letter-tile-possibilities.org | 2 +- .../1863-sum-of-all-subsets-xor-total.org | 2 +- .../0004-median-of-two-sorted-arrays.org | 2 +- .../0033-search-in-rotated-sorted-array.org | 2 +- .../binary-search/0074-search-a-2d-matrix.org | 2 +- ...3-find-minimum-in-rotated-sorted-array.org | 2 +- .../dsa/binary-search/0704-binary-search.org | 2 +- .../0719-find-k-th-smallest-pair-distance.org | 2 +- .../0875-koko-eating-bananas.org | 2 +- .../0981-time-based-key-value-store.org | 2 +- ...successful-pairs-of-spells-and-potions.org | 2 +- .../bit-manipulation/0007-reverse-integer.org | 2 +- .../bit-manipulation/0136-single-number.org | 2 +- .../bit-manipulation/0190-reverse-bits.org | 2 +- .../0191-number-of-1-bits.org | 2 +- .../bit-manipulation/0231-power-of-two.org | 2 +- .../0260-single-number-iii.org | 2 +- .../bit-manipulation/0268-missing-number.org | 2 +- .../bit-manipulation/0338-counting-bits.org | 2 +- .../0371-sum-of-two-integers.org | 2 +- ...20-minimum-bit-flips-to-convert-number.org | 2 +- .../dsa/graphs/0127-word-ladder.org | 2 +- .../dsa/graphs/0130-surrounded-regions.org | 2 +- .../dsa/graphs/0133-clone-graph.org | 2 +- .../dsa/graphs/0200-number-of-islands.org | 2 +- .../dsa/graphs/0207-course-schedule.org | 2 +- .../dsa/graphs/0210-course-schedule-ii.org | 2 +- .../dsa/graphs/0261-graph-valid-tree.org | 2 +- .../dsa/graphs/0286-walls-and-gates.org | 2 +- ...cted-components-in-an-undirected-graph.org | 2 +- .../0417-pacific-atlantic-water-flow.org | 2 +- .../dsa/graphs/0684-redundant-connection.org | 2 +- .../dsa/graphs/0695-max-area-of-island.org | 2 +- .../graphs/0802-find-eventual-safe-states.org | 2 +- .../dsa/graphs/0994-rotting-oranges.org | 2 +- .../dsa/graphs/1905-count-sub-islands.org | 2 +- .../2092-find-all-people-with-secret.org | 2 +- .../2658-maximum-number-of-fish-in-a-grid.org | 2 +- .../dsa/graphs/2924-find-champion-ii.org | 2 +- .../dsa/greedy/0045-jump-game-ii.org | 2 +- .../dsa/greedy/0053-maximum-subarray.org | 2 +- .../dsa/greedy/0055-jump-game.org | 2 +- .../dsa/greedy/0134-gas-station.org | 2 +- .../greedy/0678-valid-parenthesis-string.org | 2 +- .../dsa/greedy/0763-partition-labels.org | 2 +- .../dsa/greedy/0846-hand-of-straights.org | 2 +- ...minimum-increment-to-make-array-unique.org | 2 +- .../0978-longest-turbulent-subarray.org | 2 +- .../dsa/greedy/1871-jump-game-vii.org | 2 +- ...-merge-triplets-to-form-target-triplet.org | 2 +- .../0215-kth-largest-element-in-an-array.org | 2 +- .../0295-find-median-from-data-stream.org | 2 +- .../0355-design-twitter.org | 2 +- .../0621-task-scheduler.org | 2 +- .../0703-kth-largest-element-in-a-stream.org | 2 +- .../0973-k-closest-points-to-origin.org | 2 +- .../1046-last-stone-weight.org | 2 +- .../dsa/intervals/0056-merge-intervals.org | 2 +- .../dsa/intervals/0057-insert-interval.org | 2 +- .../dsa/intervals/0252-meeting-rooms.org | 2 +- .../dsa/intervals/0253-meeting-rooms-ii.org | 2 +- .../0435-non-overlapping-intervals.org | 2 +- .../0986-interval-list-intersections.org | 2 +- ...minimum-interval-to-include-each-query.org | 2 +- .../dsa/linked-list/0002-add-two-numbers.org | 2 +- .../0019-remove-nth-node-from-end-of-list.org | 2 +- .../0021-merge-two-sorted-lists.org | 2 +- .../linked-list/0023-merge-k-sorted-lists.org | 2 +- .../0025-reverse-nodes-in-k-group.org | 2 +- .../0138-copy-list-with-random-pointer.org | 2 +- .../linked-list/0141-linked-list-cycle.org | 2 +- .../dsa/linked-list/0143-reorder-list.org | 2 +- .../dsa/linked-list/0146-lru-cache.org | 2 +- .../linked-list/0206-reverse-linked-list.org | 2 +- .../0287-find-the-duplicate-number.org | 2 +- .../0725-split-linked-list-in-parts.org | 2 +- .../1472-design-browser-history.org | 2 +- .../1721-swapping-nodes-in-a-linked-list.org | 2 +- .../2487-remove-nodes-from-linked-list.org | 2 +- .../math-geometry/0009-palindrome-number.org | 2 +- .../math-geometry/0012-integer-to-roman.org | 2 +- .../math-geometry/0043-multiply-strings.org | 2 +- .../dsa/math-geometry/0048-rotate-image.org | 2 +- .../dsa/math-geometry/0050-pow-x-n.org | 2 +- .../dsa/math-geometry/0054-spiral-matrix.org | 2 +- .../dsa/math-geometry/0066-plus-one.org | 2 +- .../math-geometry/0073-set-matrix-zeroes.org | 2 +- .../dsa/math-geometry/0202-happy-number.org | 2 +- .../math-geometry/0296-best-meeting-point.org | 2 +- .../0840-magic-squares-in-grid.org | 2 +- ...-if-number-is-a-sum-of-powers-of-three.org | 2 +- .../dsa/math-geometry/2013-detect-squares.org | 2 +- .../math-geometry/2326-spiral-matrix-iv.org | 2 +- ...nd-the-punishment-number-of-an-integer.org | 2 +- ...substring-without-repeating-characters.org | 2 +- .../0076-minimum-window-substring.org | 2 +- .../0121-best-time-to-buy-and-sell-stock.org | 2 +- .../0239-sliding-window-maximum.org | 2 +- ...ongest-repeating-character-replacement.org | 2 +- .../0567-permutation-in-string.org | 2 +- ...aining-every-vowel-and-k-consonants-ii.org | 2 +- .../dsa/stack/0020-valid-parentheses.org | 2 +- .../0084-largest-rectangle-in-histogram.org | 2 +- .../0150-evaluate-reverse-polish-notation.org | 2 +- .../dsa/stack/0155-min-stack.org | 2 +- .../dsa/stack/0682-baseball-game.org | 2 +- .../dsa/stack/0726-number-of-atoms.org | 2 +- .../dsa/stack/0739-daily-temperatures.org | 2 +- .../dsa/stack/0853-car-fleet.org | 2 +- .../dsa/stack/0901-online-stock-span.org | 2 +- .../dsa/stack/1544-make-the-string-great.org | 2 +- .../0098-validate-binary-search-tree.org | 2 +- .../dsa/trees/0100-same-tree.org | 2 +- ...0102-binary-tree-level-order-traversal.org | 2 +- .../0104-maximum-depth-of-binary-tree.org | 2 +- ...ee-from-preorder-and-inorder-traversal.org | 2 +- .../dsa/trees/0110-balanced-binary-tree.org | 2 +- .../0124-binary-tree-maximum-path-sum.org | 2 +- .../0199-binary-tree-right-side-view.org | 2 +- .../dsa/trees/0226-invert-binary-tree.org | 2 +- .../0230-kth-smallest-element-in-a-bst.org | 2 +- ...ommon-ancestor-of-a-binary-search-tree.org | 2 +- ...-serialize-and-deserialize-binary-tree.org | 2 +- .../trees/0543-diameter-of-binary-tree.org | 2 +- .../trees/0572-subtree-of-another-tree.org | 2 +- .../0590-n-ary-tree-postorder-traversal.org | 2 +- ...recover-a-tree-from-preorder-traversal.org | 2 +- ...76-time-needed-to-inform-all-employees.org | 2 +- .../1448-count-good-nodes-in-binary-tree.org | 2 +- .../tries/0208-implement-trie-prefix-tree.org | 2 +- ...gn-add-and-search-words-data-structure.org | 2 +- .../dsa/tries/0212-word-search-ii.org | 2 +- .../dsa/tries/1166-design-file-system.org | 2 +- .../0011-container-with-most-water.org | 2 +- .../dsa/two-pointers/0015-3sum.org | 2 +- .../two-pointers/0042-trapping-rain-water.org | 2 +- .../two-pointers/0125-valid-palindrome.org | 2 +- .../0167-two-sum-ii-input-array-is-sorted.org | 2 +- .../dsa/two-pointers/0259-3sum-smaller.org | 2 +- .../dsa/two-pointers/0344-reverse-string.org | 2 +- org/study_deck_02/roadmap.org | 398 +++++++++--------- 203 files changed, 401 insertions(+), 401 deletions(-) diff --git a/leetcode/AGENTS.md b/leetcode/AGENTS.md index 1af4178..4c0ed02 100644 --- a/leetcode/AGENTS.md +++ b/leetcode/AGENTS.md @@ -83,7 +83,7 @@ Scaffolded by `scaffold-notes.mjs`. Template: * TODO 0217. Contains Duplicate :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][Roadmap]] :END: #+begin_src cpp diff --git a/leetcode/extract.mjs b/leetcode/extract.mjs index 39ddd96..971a519 100644 --- a/leetcode/extract.mjs +++ b/leetcode/extract.mjs @@ -248,7 +248,7 @@ function buildOrg(sortedNodes, problemsByTopic) { lines.push(""); lines.push(`*** TODO Python`); lines.push(`*** TODO C++`); - lines.push(`Notes: [[${notesFile}]]`); + lines.push(`Notes: [[file:${notesFile}]]`); } lines.push(""); } diff --git a/leetcode/scaffold-notes.mjs b/leetcode/scaffold-notes.mjs index ed0aa37..ec546ae 100644 --- a/leetcode/scaffold-notes.mjs +++ b/leetcode/scaffold-notes.mjs @@ -41,7 +41,7 @@ for (const line of roadmap.split("\n")) { const content = `* TODO ${num}. ${name} :${diff}: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[${relPath}][Roadmap]] +:NEETCODE: [[file:${relPath}][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org index f6b8b60..3ffa21e 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org @@ -1,7 +1,7 @@ * TODO 0005. Longest Palindromic Substring :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org index 1667b9a..076de4d 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org @@ -1,7 +1,7 @@ * TODO 0070. Climbing Stairs :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0070. Climbing Stairs][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0070. Climbing Stairs][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org index 65a171e..fd31acc 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org @@ -1,7 +1,7 @@ * TODO 0091. Decode Ways :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0091. Decode Ways][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0091. Decode Ways][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org index f59ceaa..a96c328 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org @@ -1,7 +1,7 @@ * TODO 0139. Word Break :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0139. Word Break][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0139. Word Break][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org index 8c89206..f75d182 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org @@ -1,7 +1,7 @@ * TODO 0152. Maximum Product Subarray :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org index 724cdd1..3310dc4 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org @@ -1,7 +1,7 @@ * TODO 0198. House Robber :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0198. House Robber][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0198. House Robber][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org index e00dab9..4f5b59c 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org @@ -1,7 +1,7 @@ * TODO 0213. House Robber II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0213. House Robber II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0213. House Robber II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org index 89dfddd..0f5e785 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org @@ -1,7 +1,7 @@ * TODO 0300. Longest Increasing Subsequence :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org index 408c50c..4baacab 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org @@ -1,7 +1,7 @@ * TODO 0322. Coin Change :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0322. Coin Change][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0322. Coin Change][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org index 1100b73..db62202 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org @@ -1,7 +1,7 @@ * TODO 0416. Partition Equal Subset Sum :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org index 61c5428..340de55 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org @@ -1,7 +1,7 @@ * TODO 0647. Palindromic Substrings :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0647. Palindromic Substrings][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0647. Palindromic Substrings][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org index 5da9df8..28cf800 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org @@ -1,7 +1,7 @@ * TODO 0656. Coin Path :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0656. Coin Path][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0656. Coin Path][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org b/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org index 217b3c4..e6258ed 100644 --- a/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org +++ b/org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org @@ -1,7 +1,7 @@ * TODO 0746. Min Cost Climbing Stairs :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org index 31001d3..465fd31 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0010-regular-expression-matching.org @@ -1,7 +1,7 @@ * TODO 0010. Regular Expression Matching :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0010. Regular Expression Matching][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0010. Regular Expression Matching][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org index 88f4884..837dab8 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0062-unique-paths.org @@ -1,7 +1,7 @@ * TODO 0062. Unique Paths :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0062. Unique Paths][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0062. Unique Paths][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org index c738677..ee1deb3 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org @@ -1,7 +1,7 @@ * TODO 0072. Edit Distance :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0072. Edit Distance][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org index c984328..4eed1dc 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0097-interleaving-string.org @@ -1,7 +1,7 @@ * TODO 0097. Interleaving String :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0097. Interleaving String][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0097. Interleaving String][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org index 68e6646..f5e1a94 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0115-distinct-subsequences.org @@ -1,7 +1,7 @@ * TODO 0115. Distinct Subsequences :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0115. Distinct Subsequences][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0115. Distinct Subsequences][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org index 55dfd9b..f512888 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org @@ -1,7 +1,7 @@ * TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org index cc3fc60..2bfa6d9 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0312-burst-balloons.org @@ -1,7 +1,7 @@ * TODO 0312. Burst Balloons :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0312. Burst Balloons][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0312. Burst Balloons][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org index 024eb77..1bb8b61 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org @@ -1,7 +1,7 @@ * TODO 0329. Longest Increasing Path In a Matrix :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org index 38b5d4b..c58092b 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0494-target-sum.org @@ -1,7 +1,7 @@ * TODO 0494. Target Sum :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0494. Target Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0494. Target Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org b/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org index c11447f..fba1a17 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/0518-coin-change-ii.org @@ -1,7 +1,7 @@ * TODO 0518. Coin Change II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0518. Coin Change II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0518. Coin Change II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org index da2ede1..e756248 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org @@ -1,7 +1,7 @@ * TODO 1143. Longest Common Subsequence :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org index ad59d9b..23f3c94 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org @@ -1,7 +1,7 @@ * TODO 1220. Count Vowels Permutation :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org b/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org index fe28374..08ff2ea 100644 --- a/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org +++ b/org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org @@ -1,7 +1,7 @@ * TODO 1911. Maximum Alternating Subsequence Sum :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org b/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org index 8513eee..4949996 100644 --- a/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org +++ b/org/study_deck_02/dsa/advanced-graphs/0269-alien-dictionary.org @@ -1,7 +1,7 @@ * TODO 0269. Alien Dictionary :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0269. Alien Dictionary][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0269. Alien Dictionary][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org b/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org index 6c11bf6..3c4dd70 100644 --- a/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org +++ b/org/study_deck_02/dsa/advanced-graphs/0332-reconstruct-itinerary.org @@ -1,7 +1,7 @@ * TODO 0332. Reconstruct Itinerary :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org b/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org index aa0cf32..c6583d4 100644 --- a/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org +++ b/org/study_deck_02/dsa/advanced-graphs/0743-network-delay-time.org @@ -1,7 +1,7 @@ * TODO 0743. Network Delay Time :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0743. Network Delay Time][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0743. Network Delay Time][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org b/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org index c58de69..9a691df 100644 --- a/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org +++ b/org/study_deck_02/dsa/advanced-graphs/0778-swim-in-rising-water.org @@ -1,7 +1,7 @@ * TODO 0778. Swim In Rising Water :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0778. Swim In Rising Water][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0778. Swim In Rising Water][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org b/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org index 6cf4a37..51c52b8 100644 --- a/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org +++ b/org/study_deck_02/dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org @@ -1,7 +1,7 @@ * TODO 0787. Cheapest Flights Within K Stops :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org b/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org index 53bfebc..6282a9c 100644 --- a/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org +++ b/org/study_deck_02/dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org @@ -1,7 +1,7 @@ * TODO 1584. Min Cost to Connect All Points :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org b/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org index 32a4e85..96385e1 100644 --- a/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org +++ b/org/study_deck_02/dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org @@ -1,7 +1,7 @@ * TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org b/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org index 65ce424..9b759b6 100644 --- a/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org +++ b/org/study_deck_02/dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org @@ -1,7 +1,7 @@ * TODO 2812. Find the Safest Path in a Grid :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org b/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org index 79d063a..43f32d5 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org +++ b/org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org @@ -1,7 +1,7 @@ * TODO 0001. Two Sum :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0001. Two Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0001. Two Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org b/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org index 3a5c87a..80916aa 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org +++ b/org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org @@ -1,7 +1,7 @@ * TODO 0036. Valid Sudoku :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0036. Valid Sudoku][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0036. Valid Sudoku][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org b/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org index 853ebb8..9eeb1dc 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org +++ b/org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org @@ -1,7 +1,7 @@ * TODO 0049. Group Anagrams :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0049. Group Anagrams][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0049. Group Anagrams][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org b/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org index 74f652f..b0b44a8 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org +++ b/org/study_deck_02/dsa/arrays-hashing/0128-longest-consecutive-sequence.org @@ -1,7 +1,7 @@ * TODO 0128. Longest Consecutive Sequence :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org b/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org index 61ee03e..d4001e4 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org +++ b/org/study_deck_02/dsa/arrays-hashing/0217-contains-duplicate.org @@ -1,7 +1,7 @@ * TODO 0217. Contains Duplicate :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org b/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org index 1693e44..1f988ec 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org +++ b/org/study_deck_02/dsa/arrays-hashing/0238-product-of-array-except-self.org @@ -1,7 +1,7 @@ * TODO 0238. Product of Array Except Self :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0238. Product of Array Except Self][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0238. Product of Array Except Self][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org b/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org index 3021958..a322f49 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org +++ b/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org @@ -1,7 +1,7 @@ * TODO 0242. Valid Anagram :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0242. Valid Anagram][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0242. Valid Anagram][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org b/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org index b84bc23..f4755da 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org +++ b/org/study_deck_02/dsa/arrays-hashing/0271-encode-and-decode-strings.org @@ -1,7 +1,7 @@ * TODO 0271. Encode and Decode Strings :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org b/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org index 94fdddc..e89171e 100644 --- a/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org +++ b/org/study_deck_02/dsa/arrays-hashing/0347-top-k-frequent-elements.org @@ -1,7 +1,7 @@ * TODO 0347. Top K Frequent Elements :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org b/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org index a2a4896..bfaa77c 100644 --- a/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org +++ b/org/study_deck_02/dsa/arrays-hashing/1408-string-matching-in-an-array.org @@ -1,7 +1,7 @@ * TODO 1408. String Matching in an Array :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1408. String Matching in an Array][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1408. String Matching in an Array][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org b/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org index 31ea204..840d928 100644 --- a/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org +++ b/org/study_deck_02/dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org @@ -1,7 +1,7 @@ * TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org b/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org index 81ce4f2..6308aa6 100644 --- a/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org +++ b/org/study_deck_02/dsa/arrays-hashing/2678-number-of-senior-citizens.org @@ -1,7 +1,7 @@ * TODO 2678. Number of Senior Citizens :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org b/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org index 71136d3..ab7f3e3 100644 --- a/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org +++ b/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org @@ -1,7 +1,7 @@ * TODO 0017. Letter Combinations of a Phone Number :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org index 85f0315..e1ec08b 100644 --- a/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org +++ b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org @@ -1,7 +1,7 @@ * TODO 0022. Generate Parentheses :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0022. Generate Parentheses][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0022. Generate Parentheses][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0039-combination-sum.org b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org index 872df61..516393d 100644 --- a/org/study_deck_02/dsa/backtracking/0039-combination-sum.org +++ b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org @@ -1,7 +1,7 @@ * TODO 0039. Combination Sum :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0039. Combination Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0039. Combination Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org b/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org index 3e43ba9..319637e 100644 --- a/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org +++ b/org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org @@ -1,7 +1,7 @@ * TODO 0040. Combination Sum II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0040. Combination Sum II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0040. Combination Sum II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0046-permutations.org b/org/study_deck_02/dsa/backtracking/0046-permutations.org index bade254..119f5fb 100644 --- a/org/study_deck_02/dsa/backtracking/0046-permutations.org +++ b/org/study_deck_02/dsa/backtracking/0046-permutations.org @@ -1,7 +1,7 @@ * TODO 0046. Permutations :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0046. Permutations][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0046. Permutations][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0051-n-queens.org b/org/study_deck_02/dsa/backtracking/0051-n-queens.org index 920efde..dc48568 100644 --- a/org/study_deck_02/dsa/backtracking/0051-n-queens.org +++ b/org/study_deck_02/dsa/backtracking/0051-n-queens.org @@ -1,7 +1,7 @@ * TODO 0051. N Queens :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0051. N Queens][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0051. N Queens][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org b/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org index 2a78bdc..8f31e8a 100644 --- a/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org +++ b/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org @@ -1,7 +1,7 @@ * TODO 0052. N Queens II :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0052. N Queens II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0052. N Queens II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0077-combinations.org b/org/study_deck_02/dsa/backtracking/0077-combinations.org index 194fd6f..eec49d1 100644 --- a/org/study_deck_02/dsa/backtracking/0077-combinations.org +++ b/org/study_deck_02/dsa/backtracking/0077-combinations.org @@ -1,7 +1,7 @@ * TODO 0077. Combinations :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0077. Combinations][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0077. Combinations][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0078-subsets.org b/org/study_deck_02/dsa/backtracking/0078-subsets.org index 6d136f1..9e9f8dd 100644 --- a/org/study_deck_02/dsa/backtracking/0078-subsets.org +++ b/org/study_deck_02/dsa/backtracking/0078-subsets.org @@ -1,7 +1,7 @@ * TODO 0078. Subsets :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0078. Subsets][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0078. Subsets][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0079-word-search.org b/org/study_deck_02/dsa/backtracking/0079-word-search.org index e96ed65..5af618b 100644 --- a/org/study_deck_02/dsa/backtracking/0079-word-search.org +++ b/org/study_deck_02/dsa/backtracking/0079-word-search.org @@ -1,7 +1,7 @@ * TODO 0079. Word Search :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0079. Word Search][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0079. Word Search][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org index 9cb8eda..acfee46 100644 --- a/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org +++ b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org @@ -1,7 +1,7 @@ * TODO 0090. Subsets II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0090. Subsets II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0090. Subsets II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org index 07dc0eb..ae9e72b 100644 --- a/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org +++ b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org @@ -1,7 +1,7 @@ * TODO 0131. Palindrome Partitioning :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org b/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org index a4017bc..77870ff 100644 --- a/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org +++ b/org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org @@ -1,7 +1,7 @@ * TODO 0351. Android Unlock Patterns :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org b/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org index c6ca858..0271ddf 100644 --- a/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org +++ b/org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org @@ -1,7 +1,7 @@ * TODO 1079. Letter Tile Possibilities :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org b/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org index 3bf2edf..e65f307 100644 --- a/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org +++ b/org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org @@ -1,7 +1,7 @@ * TODO 1863. Sum of All Subsets XOR Total :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org b/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org index 64c1a9d..aa78366 100644 --- a/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org +++ b/org/study_deck_02/dsa/binary-search/0004-median-of-two-sorted-arrays.org @@ -1,7 +1,7 @@ * TODO 0004. Median of Two Sorted Arrays :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org b/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org index 8d0d74b..1f924c8 100644 --- a/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org +++ b/org/study_deck_02/dsa/binary-search/0033-search-in-rotated-sorted-array.org @@ -1,7 +1,7 @@ * TODO 0033. Search In Rotated Sorted Array :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org b/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org index bc36ec1..7de04d7 100644 --- a/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org +++ b/org/study_deck_02/dsa/binary-search/0074-search-a-2d-matrix.org @@ -1,7 +1,7 @@ * TODO 0074. Search a 2D Matrix :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org b/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org index dd80d30..49c0d98 100644 --- a/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org +++ b/org/study_deck_02/dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org @@ -1,7 +1,7 @@ * TODO 0153. Find Minimum In Rotated Sorted Array :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0704-binary-search.org b/org/study_deck_02/dsa/binary-search/0704-binary-search.org index 37c1553..524ee1e 100644 --- a/org/study_deck_02/dsa/binary-search/0704-binary-search.org +++ b/org/study_deck_02/dsa/binary-search/0704-binary-search.org @@ -1,7 +1,7 @@ * TODO 0704. Binary Search :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0704. Binary Search][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0704. Binary Search][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org b/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org index 6841764..ecfd2f4 100644 --- a/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org +++ b/org/study_deck_02/dsa/binary-search/0719-find-k-th-smallest-pair-distance.org @@ -1,7 +1,7 @@ * TODO 0719. Find K-th Smallest Pair Distance :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org b/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org index 365a14a..6933ef6 100644 --- a/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org +++ b/org/study_deck_02/dsa/binary-search/0875-koko-eating-bananas.org @@ -1,7 +1,7 @@ * TODO 0875. Koko Eating Bananas :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org b/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org index 014cdae..9dbf3b7 100644 --- a/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org +++ b/org/study_deck_02/dsa/binary-search/0981-time-based-key-value-store.org @@ -1,7 +1,7 @@ * TODO 0981. Time Based Key Value Store :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org b/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org index a30db60..aa5ae73 100644 --- a/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org +++ b/org/study_deck_02/dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org @@ -1,7 +1,7 @@ * TODO 2300. Successful Pairs of Spells and Potions :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org b/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org index 48e0bf8..99f3344 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org +++ b/org/study_deck_02/dsa/bit-manipulation/0007-reverse-integer.org @@ -1,7 +1,7 @@ * TODO 0007. Reverse Integer :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0007. Reverse Integer][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0007. Reverse Integer][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org b/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org index 23bc5c6..8d835de 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org +++ b/org/study_deck_02/dsa/bit-manipulation/0136-single-number.org @@ -1,7 +1,7 @@ * TODO 0136. Single Number :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0136. Single Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0136. Single Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org b/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org index 7f4dd8f..3fda9a0 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org +++ b/org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org @@ -1,7 +1,7 @@ * TODO 0190. Reverse Bits :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0190. Reverse Bits][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0190. Reverse Bits][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org b/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org index 7dee623..6a32e99 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org +++ b/org/study_deck_02/dsa/bit-manipulation/0191-number-of-1-bits.org @@ -1,7 +1,7 @@ * TODO 0191. Number of 1 Bits :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0191. Number of 1 Bits][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0191. Number of 1 Bits][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org b/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org index 339a02b..3c66b2a 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org +++ b/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org @@ -1,7 +1,7 @@ * TODO 0231. Power of Two :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0231. Power of Two][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0231. Power of Two][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org b/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org index 089bd0d..2ea81e9 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org +++ b/org/study_deck_02/dsa/bit-manipulation/0260-single-number-iii.org @@ -1,7 +1,7 @@ * TODO 0260. Single Number III :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0260. Single Number III][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0260. Single Number III][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org b/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org index a76fedf..701ee32 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org +++ b/org/study_deck_02/dsa/bit-manipulation/0268-missing-number.org @@ -1,7 +1,7 @@ * TODO 0268. Missing Number :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0268. Missing Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0268. Missing Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org b/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org index 7cf3c7c..61311b3 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org +++ b/org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org @@ -1,7 +1,7 @@ * TODO 0338. Counting Bits :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0338. Counting Bits][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0338. Counting Bits][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org b/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org index 262e103..57d9193 100644 --- a/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org +++ b/org/study_deck_02/dsa/bit-manipulation/0371-sum-of-two-integers.org @@ -1,7 +1,7 @@ * TODO 0371. Sum of Two Integers :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0371. Sum of Two Integers][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0371. Sum of Two Integers][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org b/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org index 6275894..e535b5e 100644 --- a/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org +++ b/org/study_deck_02/dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org @@ -1,7 +1,7 @@ * TODO 2220. Minimum Bit Flips to Convert Number :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0127-word-ladder.org b/org/study_deck_02/dsa/graphs/0127-word-ladder.org index 62c31a6..f504149 100644 --- a/org/study_deck_02/dsa/graphs/0127-word-ladder.org +++ b/org/study_deck_02/dsa/graphs/0127-word-ladder.org @@ -1,7 +1,7 @@ * TODO 0127. Word Ladder :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0127. Word Ladder][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0127. Word Ladder][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org index e385e06..85ff906 100644 --- a/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org +++ b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org @@ -1,7 +1,7 @@ * TODO 0130. Surrounded Regions :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0130. Surrounded Regions][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0130. Surrounded Regions][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0133-clone-graph.org b/org/study_deck_02/dsa/graphs/0133-clone-graph.org index 210f4a2..790072f 100644 --- a/org/study_deck_02/dsa/graphs/0133-clone-graph.org +++ b/org/study_deck_02/dsa/graphs/0133-clone-graph.org @@ -1,7 +1,7 @@ * TODO 0133. Clone Graph :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0133. Clone Graph][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0133. Clone Graph][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0200-number-of-islands.org b/org/study_deck_02/dsa/graphs/0200-number-of-islands.org index d0faeef..96b01a9 100644 --- a/org/study_deck_02/dsa/graphs/0200-number-of-islands.org +++ b/org/study_deck_02/dsa/graphs/0200-number-of-islands.org @@ -1,7 +1,7 @@ * TODO 0200. Number of Islands :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0200. Number of Islands][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0200. Number of Islands][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0207-course-schedule.org b/org/study_deck_02/dsa/graphs/0207-course-schedule.org index 9c87f3e..09f2574 100644 --- a/org/study_deck_02/dsa/graphs/0207-course-schedule.org +++ b/org/study_deck_02/dsa/graphs/0207-course-schedule.org @@ -1,7 +1,7 @@ * TODO 0207. Course Schedule :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0207. Course Schedule][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0207. Course Schedule][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org b/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org index 478e733..56db44f 100644 --- a/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org +++ b/org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org @@ -1,7 +1,7 @@ * TODO 0210. Course Schedule II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0210. Course Schedule II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0210. Course Schedule II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org b/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org index 2704048..d34115c 100644 --- a/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org +++ b/org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org @@ -1,7 +1,7 @@ * TODO 0261. Graph Valid Tree :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0261. Graph Valid Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0261. Graph Valid Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org b/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org index 92bc80d..3b5beca 100644 --- a/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org +++ b/org/study_deck_02/dsa/graphs/0286-walls-and-gates.org @@ -1,7 +1,7 @@ * TODO 0286. Walls And Gates :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0286. Walls And Gates][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0286. Walls And Gates][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org b/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org index 5c6d6c4..b665b79 100644 --- a/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org +++ b/org/study_deck_02/dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org @@ -1,7 +1,7 @@ * TODO 0323. Number of Connected Components In An Undirected Graph :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org b/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org index ba05b8e..a5857dc 100644 --- a/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org +++ b/org/study_deck_02/dsa/graphs/0417-pacific-atlantic-water-flow.org @@ -1,7 +1,7 @@ * TODO 0417. Pacific Atlantic Water Flow :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0684-redundant-connection.org b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org index 3123c03..2a7376b 100644 --- a/org/study_deck_02/dsa/graphs/0684-redundant-connection.org +++ b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org @@ -1,7 +1,7 @@ * TODO 0684. Redundant Connection :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0684. Redundant Connection][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0684. Redundant Connection][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org b/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org index 857af30..86b1570 100644 --- a/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org +++ b/org/study_deck_02/dsa/graphs/0695-max-area-of-island.org @@ -1,7 +1,7 @@ * TODO 0695. Max Area of Island :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0695. Max Area of Island][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0695. Max Area of Island][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org b/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org index 08100ac..c551bf3 100644 --- a/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org +++ b/org/study_deck_02/dsa/graphs/0802-find-eventual-safe-states.org @@ -1,7 +1,7 @@ * TODO 0802. Find Eventual Safe States :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org index f6ad004..dd13ee7 100644 --- a/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org +++ b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org @@ -1,7 +1,7 @@ * TODO 0994. Rotting Oranges :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0994. Rotting Oranges][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0994. Rotting Oranges][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org b/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org index 80bc452..5944b80 100644 --- a/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org +++ b/org/study_deck_02/dsa/graphs/1905-count-sub-islands.org @@ -1,7 +1,7 @@ * TODO 1905. Count Sub Islands :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1905. Count Sub Islands][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1905. Count Sub Islands][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org b/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org index 2b38c79..47a0b85 100644 --- a/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org +++ b/org/study_deck_02/dsa/graphs/2092-find-all-people-with-secret.org @@ -1,7 +1,7 @@ * TODO 2092. Find All People With Secret :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2092. Find All People With Secret][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2092. Find All People With Secret][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org b/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org index a0b3e8b..e740c74 100644 --- a/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org +++ b/org/study_deck_02/dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org @@ -1,7 +1,7 @@ * TODO 2658. Maximum Number of Fish in a Grid :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org b/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org index 35cc1f4..cfebf85 100644 --- a/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org +++ b/org/study_deck_02/dsa/graphs/2924-find-champion-ii.org @@ -1,7 +1,7 @@ * TODO 2924. Find Champion II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2924. Find Champion II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2924. Find Champion II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org b/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org index d79755e..be1a991 100644 --- a/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org +++ b/org/study_deck_02/dsa/greedy/0045-jump-game-ii.org @@ -1,7 +1,7 @@ * TODO 0045. Jump Game II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0045. Jump Game II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0045. Jump Game II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org index 47e868f..5d19bf0 100644 --- a/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org +++ b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org @@ -1,7 +1,7 @@ * TODO 0053. Maximum Subarray :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0053. Maximum Subarray][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0053. Maximum Subarray][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0055-jump-game.org b/org/study_deck_02/dsa/greedy/0055-jump-game.org index 4ee97c3..16878ad 100644 --- a/org/study_deck_02/dsa/greedy/0055-jump-game.org +++ b/org/study_deck_02/dsa/greedy/0055-jump-game.org @@ -1,7 +1,7 @@ * TODO 0055. Jump Game :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0055. Jump Game][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0055. Jump Game][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0134-gas-station.org b/org/study_deck_02/dsa/greedy/0134-gas-station.org index 5d2ca8e..6fbfec4 100644 --- a/org/study_deck_02/dsa/greedy/0134-gas-station.org +++ b/org/study_deck_02/dsa/greedy/0134-gas-station.org @@ -1,7 +1,7 @@ * TODO 0134. Gas Station :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0134. Gas Station][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0134. Gas Station][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org b/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org index 716b357..f0b73dd 100644 --- a/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org +++ b/org/study_deck_02/dsa/greedy/0678-valid-parenthesis-string.org @@ -1,7 +1,7 @@ * TODO 0678. Valid Parenthesis String :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0678. Valid Parenthesis String][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0678. Valid Parenthesis String][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0763-partition-labels.org b/org/study_deck_02/dsa/greedy/0763-partition-labels.org index 0645a71..2c1110f 100644 --- a/org/study_deck_02/dsa/greedy/0763-partition-labels.org +++ b/org/study_deck_02/dsa/greedy/0763-partition-labels.org @@ -1,7 +1,7 @@ * TODO 0763. Partition Labels :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0763. Partition Labels][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0763. Partition Labels][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org b/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org index 8366411..a3952c6 100644 --- a/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org +++ b/org/study_deck_02/dsa/greedy/0846-hand-of-straights.org @@ -1,7 +1,7 @@ * TODO 0846. Hand of Straights :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0846. Hand of Straights][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0846. Hand of Straights][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org b/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org index 44a803f..d6ddb7f 100644 --- a/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org +++ b/org/study_deck_02/dsa/greedy/0945-minimum-increment-to-make-array-unique.org @@ -1,7 +1,7 @@ * TODO 0945. Minimum Increment to Make Array Unique :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org b/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org index b1d3cee..afed4a4 100644 --- a/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org +++ b/org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org @@ -1,7 +1,7 @@ * TODO 0978. Longest Turbulent Subarray :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org b/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org index ba407a2..f67f0a5 100644 --- a/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org +++ b/org/study_deck_02/dsa/greedy/1871-jump-game-vii.org @@ -1,7 +1,7 @@ * TODO 1871. Jump Game VII :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1871. Jump Game VII][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1871. Jump Game VII][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org b/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org index dbd5ba1..e1f1077 100644 --- a/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org +++ b/org/study_deck_02/dsa/greedy/1899-merge-triplets-to-form-target-triplet.org @@ -1,7 +1,7 @@ * TODO 1899. Merge Triplets to Form Target Triplet :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org b/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org index 05e4e65..b6c2354 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org @@ -1,7 +1,7 @@ * TODO 0215. Kth Largest Element In An Array :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0215. Kth Largest Element In An Array][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0215. Kth Largest Element In An Array][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org b/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org index d3cb709..a415245 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0295-find-median-from-data-stream.org @@ -1,7 +1,7 @@ * TODO 0295. Find Median From Data Stream :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0295. Find Median From Data Stream][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0295. Find Median From Data Stream][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org b/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org index bc464fe..3d6fc2b 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0355-design-twitter.org @@ -1,7 +1,7 @@ * TODO 0355. Design Twitter :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0355. Design Twitter][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0355. Design Twitter][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org b/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org index 9958cfe..6962625 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0621-task-scheduler.org @@ -1,7 +1,7 @@ * TODO 0621. Task Scheduler :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0621. Task Scheduler][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0621. Task Scheduler][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org b/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org index 58b39e1..2741022 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org @@ -1,7 +1,7 @@ * TODO 0703. Kth Largest Element In a Stream :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org b/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org index 52f35ca..25d7e72 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org +++ b/org/study_deck_02/dsa/heap-priority-queue/0973-k-closest-points-to-origin.org @@ -1,7 +1,7 @@ * TODO 0973. K Closest Points to Origin :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0973. K Closest Points to Origin][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0973. K Closest Points to Origin][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org b/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org index 835390d..e43ed31 100644 --- a/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org +++ b/org/study_deck_02/dsa/heap-priority-queue/1046-last-stone-weight.org @@ -1,7 +1,7 @@ * TODO 1046. Last Stone Weight :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1046. Last Stone Weight][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1046. Last Stone Weight][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0056-merge-intervals.org b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org index 2b5615e..f021470 100644 --- a/org/study_deck_02/dsa/intervals/0056-merge-intervals.org +++ b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org @@ -1,7 +1,7 @@ * TODO 0056. Merge Intervals :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0056. Merge Intervals][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0056. Merge Intervals][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0057-insert-interval.org b/org/study_deck_02/dsa/intervals/0057-insert-interval.org index 3317f99..9b20130 100644 --- a/org/study_deck_02/dsa/intervals/0057-insert-interval.org +++ b/org/study_deck_02/dsa/intervals/0057-insert-interval.org @@ -1,7 +1,7 @@ * TODO 0057. Insert Interval :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0057. Insert Interval][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0057. Insert Interval][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org index be5eef3..d27204e 100644 --- a/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org +++ b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org @@ -1,7 +1,7 @@ * TODO 0252. Meeting Rooms :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0252. Meeting Rooms][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0252. Meeting Rooms][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org b/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org index edaf4c1..a371e14 100644 --- a/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org +++ b/org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org @@ -1,7 +1,7 @@ * TODO 0253. Meeting Rooms II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0253. Meeting Rooms II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0253. Meeting Rooms II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org b/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org index b46f2ae..e6239ea 100644 --- a/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org +++ b/org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org @@ -1,7 +1,7 @@ * TODO 0435. Non Overlapping Intervals :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0435. Non Overlapping Intervals][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0435. Non Overlapping Intervals][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org b/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org index d36d21a..f6be592 100644 --- a/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org +++ b/org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org @@ -1,7 +1,7 @@ * TODO 0986. Interval List Intersections :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0986. Interval List Intersections][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0986. Interval List Intersections][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org b/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org index f04b222..4788a93 100644 --- a/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org +++ b/org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org @@ -1,7 +1,7 @@ * TODO 1851. Minimum Interval to Include Each Query :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org b/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org index 64dee49..deee2ab 100644 --- a/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org +++ b/org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org @@ -1,7 +1,7 @@ * TODO 0002. Add Two Numbers :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0002. Add Two Numbers][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0002. Add Two Numbers][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org b/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org index 1ac10a3..54dad34 100644 --- a/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org +++ b/org/study_deck_02/dsa/linked-list/0019-remove-nth-node-from-end-of-list.org @@ -1,7 +1,7 @@ * TODO 0019. Remove Nth Node From End of List :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org b/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org index 66ec829..d71de96 100644 --- a/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org +++ b/org/study_deck_02/dsa/linked-list/0021-merge-two-sorted-lists.org @@ -1,7 +1,7 @@ * TODO 0021. Merge Two Sorted Lists :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org b/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org index 8bd30e0..b0ee04e 100644 --- a/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org +++ b/org/study_deck_02/dsa/linked-list/0023-merge-k-sorted-lists.org @@ -1,7 +1,7 @@ * TODO 0023. Merge K Sorted Lists :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0023. Merge K Sorted Lists][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0023. Merge K Sorted Lists][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org b/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org index ba7259d..6350241 100644 --- a/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org +++ b/org/study_deck_02/dsa/linked-list/0025-reverse-nodes-in-k-group.org @@ -1,7 +1,7 @@ * TODO 0025. Reverse Nodes In K Group :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org b/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org index 109a8f4..ae19bc8 100644 --- a/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org +++ b/org/study_deck_02/dsa/linked-list/0138-copy-list-with-random-pointer.org @@ -1,7 +1,7 @@ * TODO 0138. Copy List With Random Pointer :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0138. Copy List With Random Pointer][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0138. Copy List With Random Pointer][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org b/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org index 18ca4a6..9b12a3d 100644 --- a/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org +++ b/org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org @@ -1,7 +1,7 @@ * TODO 0141. Linked List Cycle :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0141. Linked List Cycle][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0141. Linked List Cycle][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0143-reorder-list.org b/org/study_deck_02/dsa/linked-list/0143-reorder-list.org index 94760cf..d6f634e 100644 --- a/org/study_deck_02/dsa/linked-list/0143-reorder-list.org +++ b/org/study_deck_02/dsa/linked-list/0143-reorder-list.org @@ -1,7 +1,7 @@ * TODO 0143. Reorder List :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0143. Reorder List][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0143. Reorder List][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0146-lru-cache.org b/org/study_deck_02/dsa/linked-list/0146-lru-cache.org index a4d1c41..26c8501 100644 --- a/org/study_deck_02/dsa/linked-list/0146-lru-cache.org +++ b/org/study_deck_02/dsa/linked-list/0146-lru-cache.org @@ -1,7 +1,7 @@ * TODO 0146. LRU Cache :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0146. LRU Cache][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0146. LRU Cache][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org b/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org index d1cc57d..54da64c 100644 --- a/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org +++ b/org/study_deck_02/dsa/linked-list/0206-reverse-linked-list.org @@ -1,7 +1,7 @@ * TODO 0206. Reverse Linked List :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0206. Reverse Linked List][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0206. Reverse Linked List][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org b/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org index 405ab62..fb1e3c3 100644 --- a/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org +++ b/org/study_deck_02/dsa/linked-list/0287-find-the-duplicate-number.org @@ -1,7 +1,7 @@ * TODO 0287. Find The Duplicate Number :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0287. Find The Duplicate Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0287. Find The Duplicate Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org b/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org index ad42f10..c2dd9d9 100644 --- a/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org +++ b/org/study_deck_02/dsa/linked-list/0725-split-linked-list-in-parts.org @@ -1,7 +1,7 @@ * TODO 0725. Split Linked List in Parts :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0725. Split Linked List in Parts][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0725. Split Linked List in Parts][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org b/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org index 135f1f2..3b022d3 100644 --- a/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org +++ b/org/study_deck_02/dsa/linked-list/1472-design-browser-history.org @@ -1,7 +1,7 @@ * TODO 1472. Design Browser History :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1472. Design Browser History][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1472. Design Browser History][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org b/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org index 624cb14..713f316 100644 --- a/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org +++ b/org/study_deck_02/dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org @@ -1,7 +1,7 @@ * TODO 1721. Swapping Nodes in a Linked List :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org b/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org index 0fe08e6..2931c17 100644 --- a/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org +++ b/org/study_deck_02/dsa/linked-list/2487-remove-nodes-from-linked-list.org @@ -1,7 +1,7 @@ * TODO 2487. Remove Nodes From Linked List :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org b/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org index 259ec79..1366bfa 100644 --- a/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org +++ b/org/study_deck_02/dsa/math-geometry/0009-palindrome-number.org @@ -1,7 +1,7 @@ * TODO 0009. Palindrome Number :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0009. Palindrome Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0009. Palindrome Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org b/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org index 2fbf233..2e525b5 100644 --- a/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org +++ b/org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org @@ -1,7 +1,7 @@ * TODO 0012. Integer to Roman :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0012. Integer to Roman][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0012. Integer to Roman][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org b/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org index b878b30..0836a1a 100644 --- a/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org +++ b/org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org @@ -1,7 +1,7 @@ * TODO 0043. Multiply Strings :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0043. Multiply Strings][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0043. Multiply Strings][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org b/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org index 4678b7f..6c5ae98 100644 --- a/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org +++ b/org/study_deck_02/dsa/math-geometry/0048-rotate-image.org @@ -1,7 +1,7 @@ * TODO 0048. Rotate Image :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0048. Rotate Image][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0048. Rotate Image][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org b/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org index 88ef2e1..0cad04d 100644 --- a/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org +++ b/org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org @@ -1,7 +1,7 @@ * TODO 0050. Pow(x, n) :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0050. Pow(x, n)][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0050. Pow(x, n)][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org b/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org index 691c870..22d02eb 100644 --- a/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org +++ b/org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org @@ -1,7 +1,7 @@ * TODO 0054. Spiral Matrix :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0054. Spiral Matrix][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0054. Spiral Matrix][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0066-plus-one.org b/org/study_deck_02/dsa/math-geometry/0066-plus-one.org index 4a84a43..cbfcf35 100644 --- a/org/study_deck_02/dsa/math-geometry/0066-plus-one.org +++ b/org/study_deck_02/dsa/math-geometry/0066-plus-one.org @@ -1,7 +1,7 @@ * TODO 0066. Plus One :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0066. Plus One][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0066. Plus One][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org b/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org index ab35f89..9f84f65 100644 --- a/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org +++ b/org/study_deck_02/dsa/math-geometry/0073-set-matrix-zeroes.org @@ -1,7 +1,7 @@ * TODO 0073. Set Matrix Zeroes :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0073. Set Matrix Zeroes][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0073. Set Matrix Zeroes][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0202-happy-number.org b/org/study_deck_02/dsa/math-geometry/0202-happy-number.org index db08a8b..8c7906e 100644 --- a/org/study_deck_02/dsa/math-geometry/0202-happy-number.org +++ b/org/study_deck_02/dsa/math-geometry/0202-happy-number.org @@ -1,7 +1,7 @@ * TODO 0202. Happy Number :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0202. Happy Number][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0202. Happy Number][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org b/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org index 8b40e45..51607cc 100644 --- a/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org +++ b/org/study_deck_02/dsa/math-geometry/0296-best-meeting-point.org @@ -1,7 +1,7 @@ * TODO 0296. Best Meeting Point :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0296. Best Meeting Point][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0296. Best Meeting Point][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org b/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org index 2064a36..9835ec0 100644 --- a/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org +++ b/org/study_deck_02/dsa/math-geometry/0840-magic-squares-in-grid.org @@ -1,7 +1,7 @@ * TODO 0840. Magic Squares In Grid :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0840. Magic Squares In Grid][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0840. Magic Squares In Grid][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org b/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org index d30f420..643316c 100644 --- a/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org +++ b/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org @@ -1,7 +1,7 @@ * TODO 1780. Check if Number is a Sum of Powers of Three :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org b/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org index 5e3d39d..ad77e70 100644 --- a/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org +++ b/org/study_deck_02/dsa/math-geometry/2013-detect-squares.org @@ -1,7 +1,7 @@ * TODO 2013. Detect Squares :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2013. Detect Squares][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2013. Detect Squares][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org b/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org index 8377e67..49d0b44 100644 --- a/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org +++ b/org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org @@ -1,7 +1,7 @@ * TODO 2326. Spiral Matrix IV :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2326. Spiral Matrix IV][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2326. Spiral Matrix IV][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org b/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org index 0f91ed9..10a624d 100644 --- a/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org +++ b/org/study_deck_02/dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org @@ -1,7 +1,7 @@ * TODO 2698. Find the Punishment Number of an Integer :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org b/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org index d9fff60..0003ea8 100644 --- a/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org +++ b/org/study_deck_02/dsa/sliding-window/0003-longest-substring-without-repeating-characters.org @@ -1,7 +1,7 @@ * TODO 0003. Longest Substring Without Repeating Characters :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org b/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org index b526ade..9c4b64c 100644 --- a/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org +++ b/org/study_deck_02/dsa/sliding-window/0076-minimum-window-substring.org @@ -1,7 +1,7 @@ * TODO 0076. Minimum Window Substring :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0076. Minimum Window Substring][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0076. Minimum Window Substring][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org b/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org index 324982f..f42fabc 100644 --- a/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org +++ b/org/study_deck_02/dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org @@ -1,7 +1,7 @@ * TODO 0121. Best Time to Buy And Sell Stock :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org b/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org index 9f251c9..4e88e9a 100644 --- a/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org +++ b/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org @@ -1,7 +1,7 @@ * TODO 0239. Sliding Window Maximum :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0239. Sliding Window Maximum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0239. Sliding Window Maximum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org b/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org index 974cd95..7d2bb96 100644 --- a/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org +++ b/org/study_deck_02/dsa/sliding-window/0424-longest-repeating-character-replacement.org @@ -1,7 +1,7 @@ * TODO 0424. Longest Repeating Character Replacement :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org b/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org index 5585afc..f25d668 100644 --- a/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org +++ b/org/study_deck_02/dsa/sliding-window/0567-permutation-in-string.org @@ -1,7 +1,7 @@ * TODO 0567. Permutation In String :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0567. Permutation In String][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0567. Permutation In String][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org b/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org index 9247e8a..d389c67 100644 --- a/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org +++ b/org/study_deck_02/dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org @@ -1,7 +1,7 @@ * TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0020-valid-parentheses.org b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org index a4690d2..efa2c56 100644 --- a/org/study_deck_02/dsa/stack/0020-valid-parentheses.org +++ b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org @@ -1,7 +1,7 @@ * TODO 0020. Valid Parentheses :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0020. Valid Parentheses][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0020. Valid Parentheses][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org b/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org index 7c6c00d..d93f018 100644 --- a/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org +++ b/org/study_deck_02/dsa/stack/0084-largest-rectangle-in-histogram.org @@ -1,7 +1,7 @@ * TODO 0084. Largest Rectangle In Histogram :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org b/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org index 139cc16..1f7855b 100644 --- a/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org +++ b/org/study_deck_02/dsa/stack/0150-evaluate-reverse-polish-notation.org @@ -1,7 +1,7 @@ * TODO 0150. Evaluate Reverse Polish Notation :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0155-min-stack.org b/org/study_deck_02/dsa/stack/0155-min-stack.org index 07ab162..58fa4e8 100644 --- a/org/study_deck_02/dsa/stack/0155-min-stack.org +++ b/org/study_deck_02/dsa/stack/0155-min-stack.org @@ -1,7 +1,7 @@ * TODO 0155. Min Stack :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0155. Min Stack][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0155. Min Stack][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0682-baseball-game.org b/org/study_deck_02/dsa/stack/0682-baseball-game.org index 849dc83..1d005b9 100644 --- a/org/study_deck_02/dsa/stack/0682-baseball-game.org +++ b/org/study_deck_02/dsa/stack/0682-baseball-game.org @@ -1,7 +1,7 @@ * TODO 0682. Baseball Game :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0682. Baseball Game][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0682. Baseball Game][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0726-number-of-atoms.org b/org/study_deck_02/dsa/stack/0726-number-of-atoms.org index 2eb1287..a80b89d 100644 --- a/org/study_deck_02/dsa/stack/0726-number-of-atoms.org +++ b/org/study_deck_02/dsa/stack/0726-number-of-atoms.org @@ -1,7 +1,7 @@ * TODO 0726. Number of Atoms :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0726. Number of Atoms][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0726. Number of Atoms][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0739-daily-temperatures.org b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org index fb64f21..3ae0b29 100644 --- a/org/study_deck_02/dsa/stack/0739-daily-temperatures.org +++ b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org @@ -1,7 +1,7 @@ * TODO 0739. Daily Temperatures :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0739. Daily Temperatures][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0739. Daily Temperatures][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0853-car-fleet.org b/org/study_deck_02/dsa/stack/0853-car-fleet.org index 5067901..c92633f 100644 --- a/org/study_deck_02/dsa/stack/0853-car-fleet.org +++ b/org/study_deck_02/dsa/stack/0853-car-fleet.org @@ -1,7 +1,7 @@ * TODO 0853. Car Fleet :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0853. Car Fleet][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0853. Car Fleet][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/0901-online-stock-span.org b/org/study_deck_02/dsa/stack/0901-online-stock-span.org index 1edd9d6..98b9569 100644 --- a/org/study_deck_02/dsa/stack/0901-online-stock-span.org +++ b/org/study_deck_02/dsa/stack/0901-online-stock-span.org @@ -1,7 +1,7 @@ * TODO 0901. Online Stock Span :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0901. Online Stock Span][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0901. Online Stock Span][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/stack/1544-make-the-string-great.org b/org/study_deck_02/dsa/stack/1544-make-the-string-great.org index 7370e13..3928b1d 100644 --- a/org/study_deck_02/dsa/stack/1544-make-the-string-great.org +++ b/org/study_deck_02/dsa/stack/1544-make-the-string-great.org @@ -1,7 +1,7 @@ * TODO 1544. Make The String Great :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1544. Make The String Great][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1544. Make The String Great][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org b/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org index 001a729..c87f9a0 100644 --- a/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org +++ b/org/study_deck_02/dsa/trees/0098-validate-binary-search-tree.org @@ -1,7 +1,7 @@ * TODO 0098. Validate Binary Search Tree :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0098. Validate Binary Search Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0098. Validate Binary Search Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0100-same-tree.org b/org/study_deck_02/dsa/trees/0100-same-tree.org index ecdc116..ab129f9 100644 --- a/org/study_deck_02/dsa/trees/0100-same-tree.org +++ b/org/study_deck_02/dsa/trees/0100-same-tree.org @@ -1,7 +1,7 @@ * TODO 0100. Same Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0100. Same Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0100. Same Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org b/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org index b221c54..7708d38 100644 --- a/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org +++ b/org/study_deck_02/dsa/trees/0102-binary-tree-level-order-traversal.org @@ -1,7 +1,7 @@ * TODO 0102. Binary Tree Level Order Traversal :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org b/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org index 4fe00cb..c11d7cb 100644 --- a/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org +++ b/org/study_deck_02/dsa/trees/0104-maximum-depth-of-binary-tree.org @@ -1,7 +1,7 @@ * TODO 0104. Maximum Depth of Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org b/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org index aea9153..3615278 100644 --- a/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org +++ b/org/study_deck_02/dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org @@ -1,7 +1,7 @@ * TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org b/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org index 1f1c9e1..ccd2130 100644 --- a/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org +++ b/org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org @@ -1,7 +1,7 @@ * TODO 0110. Balanced Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0110. Balanced Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0110. Balanced Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org b/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org index ce596bf..b949eea 100644 --- a/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org +++ b/org/study_deck_02/dsa/trees/0124-binary-tree-maximum-path-sum.org @@ -1,7 +1,7 @@ * TODO 0124. Binary Tree Maximum Path Sum :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org b/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org index 10a0350..c4265e4 100644 --- a/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org +++ b/org/study_deck_02/dsa/trees/0199-binary-tree-right-side-view.org @@ -1,7 +1,7 @@ * TODO 0199. Binary Tree Right Side View :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0199. Binary Tree Right Side View][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0199. Binary Tree Right Side View][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org b/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org index 028a7e1..f935b36 100644 --- a/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org +++ b/org/study_deck_02/dsa/trees/0226-invert-binary-tree.org @@ -1,7 +1,7 @@ * TODO 0226. Invert Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0226. Invert Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0226. Invert Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org b/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org index d8485c1..dbed89e 100644 --- a/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org +++ b/org/study_deck_02/dsa/trees/0230-kth-smallest-element-in-a-bst.org @@ -1,7 +1,7 @@ * TODO 0230. Kth Smallest Element In a Bst :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org b/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org index 6b2b52d..999507d 100644 --- a/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org +++ b/org/study_deck_02/dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org @@ -1,7 +1,7 @@ * TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org b/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org index 6cb2e9b..db36d5e 100644 --- a/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org +++ b/org/study_deck_02/dsa/trees/0297-serialize-and-deserialize-binary-tree.org @@ -1,7 +1,7 @@ * TODO 0297. Serialize And Deserialize Binary Tree :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org b/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org index b8f9a8a..06aae80 100644 --- a/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org +++ b/org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org @@ -1,7 +1,7 @@ * TODO 0543. Diameter of Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0543. Diameter of Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0543. Diameter of Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org b/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org index e6458e5..d0a0ab2 100644 --- a/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org +++ b/org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org @@ -1,7 +1,7 @@ * TODO 0572. Subtree of Another Tree :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0572. Subtree of Another Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0572. Subtree of Another Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org b/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org index d29ba27..0034b41 100644 --- a/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org +++ b/org/study_deck_02/dsa/trees/0590-n-ary-tree-postorder-traversal.org @@ -1,7 +1,7 @@ * TODO 0590. N-ary Tree Postorder Traversal :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org b/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org index d03c3a2..6cd84d8 100644 --- a/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org +++ b/org/study_deck_02/dsa/trees/1028-recover-a-tree-from-preorder-traversal.org @@ -1,7 +1,7 @@ * TODO 1028. Recover a Tree From Preorder Traversal :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org b/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org index ae66c71..91fe56d 100644 --- a/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org +++ b/org/study_deck_02/dsa/trees/1376-time-needed-to-inform-all-employees.org @@ -1,7 +1,7 @@ * TODO 1376. Time Needed to Inform All Employees :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org b/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org index 290ddc8..faa7c71 100644 --- a/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org +++ b/org/study_deck_02/dsa/trees/1448-count-good-nodes-in-binary-tree.org @@ -1,7 +1,7 @@ * TODO 1448. Count Good Nodes In Binary Tree :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org b/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org index 0737fdb..a9d76cd 100644 --- a/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org +++ b/org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org @@ -1,7 +1,7 @@ * TODO 0208. Implement Trie Prefix Tree :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org b/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org index ad63c5a..c18ccb4 100644 --- a/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org +++ b/org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org @@ -1,7 +1,7 @@ * TODO 0211. Design Add And Search Words Data Structure :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/tries/0212-word-search-ii.org b/org/study_deck_02/dsa/tries/0212-word-search-ii.org index 801c306..8537e9f 100644 --- a/org/study_deck_02/dsa/tries/0212-word-search-ii.org +++ b/org/study_deck_02/dsa/tries/0212-word-search-ii.org @@ -1,7 +1,7 @@ * TODO 0212. Word Search II :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0212. Word Search II][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0212. Word Search II][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/tries/1166-design-file-system.org b/org/study_deck_02/dsa/tries/1166-design-file-system.org index bed9cc3..7865bc7 100644 --- a/org/study_deck_02/dsa/tries/1166-design-file-system.org +++ b/org/study_deck_02/dsa/tries/1166-design-file-system.org @@ -1,7 +1,7 @@ * TODO 1166. Design File System :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*1166. Design File System][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*1166. Design File System][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org b/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org index 00edb3b..d11c1c2 100644 --- a/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org +++ b/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org @@ -1,7 +1,7 @@ * TODO 0011. Container With Most Water :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0011. Container With Most Water][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0011. Container With Most Water][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0015-3sum.org b/org/study_deck_02/dsa/two-pointers/0015-3sum.org index ba2a62b..34e8bd3 100644 --- a/org/study_deck_02/dsa/two-pointers/0015-3sum.org +++ b/org/study_deck_02/dsa/two-pointers/0015-3sum.org @@ -1,7 +1,7 @@ * TODO 0015. 3Sum :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0015. 3Sum][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0015. 3Sum][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org b/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org index d9c466d..8c6b077 100644 --- a/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org +++ b/org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org @@ -1,7 +1,7 @@ * TODO 0042. Trapping Rain Water :hard: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0042. Trapping Rain Water][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0042. Trapping Rain Water][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org b/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org index 0afb54a..6b934d6 100644 --- a/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org +++ b/org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org @@ -1,7 +1,7 @@ * TODO 0125. Valid Palindrome :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0125. Valid Palindrome][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0125. Valid Palindrome][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org b/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org index 1d6721e..7365df7 100644 --- a/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org +++ b/org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org @@ -1,7 +1,7 @@ * TODO 0167. Two Sum II Input Array Is Sorted :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org b/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org index aec2445..858f068 100644 --- a/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org +++ b/org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org @@ -1,7 +1,7 @@ * TODO 0259. 3Sum Smaller :medium: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0259. 3Sum Smaller][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0259. 3Sum Smaller][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org b/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org index 49645ed..a3ac871 100644 --- a/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org +++ b/org/study_deck_02/dsa/two-pointers/0344-reverse-string.org @@ -1,7 +1,7 @@ * TODO 0344. Reverse String :easy: #+PROPERTY: STUDY_DECK_02 :PROPERTIES: -:NEETCODE: [[../../roadmap.org::*0344. Reverse String][Roadmap]] +:NEETCODE: [[file:../../roadmap.org::*0344. Reverse String][Roadmap]] :END: ** TODO Approach diff --git a/org/study_deck_02/roadmap.org b/org/study_deck_02/roadmap.org index 7a9a33b..016ed7f 100644 --- a/org/study_deck_02/roadmap.org +++ b/org/study_deck_02/roadmap.org @@ -18,7 +18,7 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0217-contains-duplicate.org]] +Notes: [[file:dsa/arrays-hashing/0217-contains-duplicate.org]] ** TODO 0242. Valid Anagram :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-anagram/][Problem]] @@ -29,7 +29,7 @@ Notes: [[dsa/arrays-hashing/0217-contains-duplicate.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0242-valid-anagram.org]] +Notes: [[file:dsa/arrays-hashing/0242-valid-anagram.org]] ** TODO 2678. Number of Senior Citizens :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/number-of-senior-citizens/][Problem]] @@ -40,7 +40,7 @@ Notes: [[dsa/arrays-hashing/0242-valid-anagram.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/2678-number-of-senior-citizens.org]] +Notes: [[file:dsa/arrays-hashing/2678-number-of-senior-citizens.org]] ** TODO 0001. Two Sum :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/two-sum/][Problem]] @@ -51,7 +51,7 @@ Notes: [[dsa/arrays-hashing/2678-number-of-senior-citizens.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0001-two-sum.org]] +Notes: [[file:dsa/arrays-hashing/0001-two-sum.org]] ** TODO 1408. String Matching in an Array :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/string-matching-in-an-array/][Problem]] @@ -62,7 +62,7 @@ Notes: [[dsa/arrays-hashing/0001-two-sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/1408-string-matching-in-an-array.org]] +Notes: [[file:dsa/arrays-hashing/1408-string-matching-in-an-array.org]] ** TODO 0049. Group Anagrams :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/group-anagrams/][Problem]] @@ -73,7 +73,7 @@ Notes: [[dsa/arrays-hashing/1408-string-matching-in-an-array.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0049-group-anagrams.org]] +Notes: [[file:dsa/arrays-hashing/0049-group-anagrams.org]] ** TODO 0347. Top K Frequent Elements :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/top-k-frequent-elements/][Problem]] @@ -84,7 +84,7 @@ Notes: [[dsa/arrays-hashing/0049-group-anagrams.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0347-top-k-frequent-elements.org]] +Notes: [[file:dsa/arrays-hashing/0347-top-k-frequent-elements.org]] ** TODO 0271. Encode and Decode Strings :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/encode-and-decode-strings/][Problem]] @@ -95,7 +95,7 @@ Notes: [[dsa/arrays-hashing/0347-top-k-frequent-elements.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0271-encode-and-decode-strings.org]] +Notes: [[file:dsa/arrays-hashing/0271-encode-and-decode-strings.org]] ** TODO 0238. Product of Array Except Self :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/product-of-array-except-self/][Problem]] @@ -106,7 +106,7 @@ Notes: [[dsa/arrays-hashing/0271-encode-and-decode-strings.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0238-product-of-array-except-self.org]] +Notes: [[file:dsa/arrays-hashing/0238-product-of-array-except-self.org]] ** TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/][Problem]] @@ -117,7 +117,7 @@ Notes: [[dsa/arrays-hashing/0238-product-of-array-except-self.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org]] +Notes: [[file:dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.org]] ** TODO 0036. Valid Sudoku :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-sudoku/][Problem]] @@ -128,7 +128,7 @@ Notes: [[dsa/arrays-hashing/1769-minimum-number-of-operations-to-move-all-balls- *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0036-valid-sudoku.org]] +Notes: [[file:dsa/arrays-hashing/0036-valid-sudoku.org]] ** TODO 0128. Longest Consecutive Sequence :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-consecutive-sequence/][Problem]] @@ -139,7 +139,7 @@ Notes: [[dsa/arrays-hashing/0036-valid-sudoku.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/arrays-hashing/0128-longest-consecutive-sequence.org]] +Notes: [[file:dsa/arrays-hashing/0128-longest-consecutive-sequence.org]] * TODO Two Pointers [/] @@ -153,7 +153,7 @@ Notes: [[dsa/arrays-hashing/0128-longest-consecutive-sequence.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0344-reverse-string.org]] +Notes: [[file:dsa/two-pointers/0344-reverse-string.org]] ** TODO 0125. Valid Palindrome :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-palindrome/][Problem]] @@ -164,7 +164,7 @@ Notes: [[dsa/two-pointers/0344-reverse-string.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0125-valid-palindrome.org]] +Notes: [[file:dsa/two-pointers/0125-valid-palindrome.org]] ** TODO 0167. Two Sum II Input Array Is Sorted :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/][Problem]] @@ -175,7 +175,7 @@ Notes: [[dsa/two-pointers/0125-valid-palindrome.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org]] +Notes: [[file:dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org]] ** TODO 0015. 3Sum :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/3sum/][Problem]] @@ -186,7 +186,7 @@ Notes: [[dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0015-3sum.org]] +Notes: [[file:dsa/two-pointers/0015-3sum.org]] ** TODO 0011. Container With Most Water :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/container-with-most-water/][Problem]] @@ -197,7 +197,7 @@ Notes: [[dsa/two-pointers/0015-3sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0011-container-with-most-water.org]] +Notes: [[file:dsa/two-pointers/0011-container-with-most-water.org]] ** TODO 0259. 3Sum Smaller :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/3sum-smaller/][Problem]] @@ -207,7 +207,7 @@ Notes: [[dsa/two-pointers/0011-container-with-most-water.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0259-3sum-smaller.org]] +Notes: [[file:dsa/two-pointers/0259-3sum-smaller.org]] ** TODO 0042. Trapping Rain Water :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/trapping-rain-water/][Problem]] @@ -218,7 +218,7 @@ Notes: [[dsa/two-pointers/0259-3sum-smaller.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/two-pointers/0042-trapping-rain-water.org]] +Notes: [[file:dsa/two-pointers/0042-trapping-rain-water.org]] * TODO Binary Search [/] @@ -232,7 +232,7 @@ Notes: [[dsa/two-pointers/0042-trapping-rain-water.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0704-binary-search.org]] +Notes: [[file:dsa/binary-search/0704-binary-search.org]] ** TODO 2300. Successful Pairs of Spells and Potions :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/successful-pairs-of-spells-and-potions/][Problem]] @@ -243,7 +243,7 @@ Notes: [[dsa/binary-search/0704-binary-search.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org]] +Notes: [[file:dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org]] ** TODO 0074. Search a 2D Matrix :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/search-a-2d-matrix/][Problem]] @@ -254,7 +254,7 @@ Notes: [[dsa/binary-search/2300-successful-pairs-of-spells-and-potions.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0074-search-a-2d-matrix.org]] +Notes: [[file:dsa/binary-search/0074-search-a-2d-matrix.org]] ** TODO 0875. Koko Eating Bananas :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/koko-eating-bananas/][Problem]] @@ -265,7 +265,7 @@ Notes: [[dsa/binary-search/0074-search-a-2d-matrix.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0875-koko-eating-bananas.org]] +Notes: [[file:dsa/binary-search/0875-koko-eating-bananas.org]] ** TODO 0153. Find Minimum In Rotated Sorted Array :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/][Problem]] @@ -276,7 +276,7 @@ Notes: [[dsa/binary-search/0875-koko-eating-bananas.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org]] +Notes: [[file:dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org]] ** TODO 0033. Search In Rotated Sorted Array :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/search-in-rotated-sorted-array/][Problem]] @@ -287,7 +287,7 @@ Notes: [[dsa/binary-search/0153-find-minimum-in-rotated-sorted-array.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0033-search-in-rotated-sorted-array.org]] +Notes: [[file:dsa/binary-search/0033-search-in-rotated-sorted-array.org]] ** TODO 0981. Time Based Key Value Store :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/time-based-key-value-store/][Problem]] @@ -298,7 +298,7 @@ Notes: [[dsa/binary-search/0033-search-in-rotated-sorted-array.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0981-time-based-key-value-store.org]] +Notes: [[file:dsa/binary-search/0981-time-based-key-value-store.org]] ** TODO 0719. Find K-th Smallest Pair Distance :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-k-th-smallest-pair-distance/][Problem]] @@ -309,7 +309,7 @@ Notes: [[dsa/binary-search/0981-time-based-key-value-store.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0719-find-k-th-smallest-pair-distance.org]] +Notes: [[file:dsa/binary-search/0719-find-k-th-smallest-pair-distance.org]] ** TODO 0004. Median of Two Sorted Arrays :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/median-of-two-sorted-arrays/][Problem]] @@ -320,7 +320,7 @@ Notes: [[dsa/binary-search/0719-find-k-th-smallest-pair-distance.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/binary-search/0004-median-of-two-sorted-arrays.org]] +Notes: [[file:dsa/binary-search/0004-median-of-two-sorted-arrays.org]] * TODO Stack [/] @@ -334,7 +334,7 @@ Notes: [[dsa/binary-search/0004-median-of-two-sorted-arrays.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0682-baseball-game.org]] +Notes: [[file:dsa/stack/0682-baseball-game.org]] ** TODO 0020. Valid Parentheses :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-parentheses/][Problem]] @@ -345,7 +345,7 @@ Notes: [[dsa/stack/0682-baseball-game.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0020-valid-parentheses.org]] +Notes: [[file:dsa/stack/0020-valid-parentheses.org]] ** TODO 1544. Make The String Great :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/make-the-string-great/][Problem]] @@ -356,7 +356,7 @@ Notes: [[dsa/stack/0020-valid-parentheses.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/1544-make-the-string-great.org]] +Notes: [[file:dsa/stack/1544-make-the-string-great.org]] ** TODO 0155. Min Stack :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/min-stack/][Problem]] @@ -367,7 +367,7 @@ Notes: [[dsa/stack/1544-make-the-string-great.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0155-min-stack.org]] +Notes: [[file:dsa/stack/0155-min-stack.org]] ** TODO 0150. Evaluate Reverse Polish Notation :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/evaluate-reverse-polish-notation/][Problem]] @@ -378,7 +378,7 @@ Notes: [[dsa/stack/0155-min-stack.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0150-evaluate-reverse-polish-notation.org]] +Notes: [[file:dsa/stack/0150-evaluate-reverse-polish-notation.org]] ** TODO 0739. Daily Temperatures :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/daily-temperatures/][Problem]] @@ -389,7 +389,7 @@ Notes: [[dsa/stack/0150-evaluate-reverse-polish-notation.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0739-daily-temperatures.org]] +Notes: [[file:dsa/stack/0739-daily-temperatures.org]] ** TODO 0901. Online Stock Span :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/online-stock-span/][Problem]] @@ -400,7 +400,7 @@ Notes: [[dsa/stack/0739-daily-temperatures.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0901-online-stock-span.org]] +Notes: [[file:dsa/stack/0901-online-stock-span.org]] ** TODO 0853. Car Fleet :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/car-fleet/][Problem]] @@ -411,7 +411,7 @@ Notes: [[dsa/stack/0901-online-stock-span.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0853-car-fleet.org]] +Notes: [[file:dsa/stack/0853-car-fleet.org]] ** TODO 0084. Largest Rectangle In Histogram :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/largest-rectangle-in-histogram/][Problem]] @@ -422,7 +422,7 @@ Notes: [[dsa/stack/0853-car-fleet.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0084-largest-rectangle-in-histogram.org]] +Notes: [[file:dsa/stack/0084-largest-rectangle-in-histogram.org]] ** TODO 0726. Number of Atoms :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/number-of-atoms/][Problem]] @@ -433,7 +433,7 @@ Notes: [[dsa/stack/0084-largest-rectangle-in-histogram.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/stack/0726-number-of-atoms.org]] +Notes: [[file:dsa/stack/0726-number-of-atoms.org]] * TODO Sliding Window [/] @@ -447,7 +447,7 @@ Notes: [[dsa/stack/0726-number-of-atoms.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org]] +Notes: [[file:dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org]] ** TODO 0003. Longest Substring Without Repeating Characters :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-substring-without-repeating-characters/][Problem]] @@ -458,7 +458,7 @@ Notes: [[dsa/sliding-window/0121-best-time-to-buy-and-sell-stock.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0003-longest-substring-without-repeating-characters.org]] +Notes: [[file:dsa/sliding-window/0003-longest-substring-without-repeating-characters.org]] ** TODO 0424. Longest Repeating Character Replacement :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-repeating-character-replacement/][Problem]] @@ -469,7 +469,7 @@ Notes: [[dsa/sliding-window/0003-longest-substring-without-repeating-characters. *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0424-longest-repeating-character-replacement.org]] +Notes: [[file:dsa/sliding-window/0424-longest-repeating-character-replacement.org]] ** TODO 0567. Permutation In String :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/permutation-in-string/][Problem]] @@ -480,7 +480,7 @@ Notes: [[dsa/sliding-window/0424-longest-repeating-character-replacement.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0567-permutation-in-string.org]] +Notes: [[file:dsa/sliding-window/0567-permutation-in-string.org]] ** TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/][Problem]] @@ -491,7 +491,7 @@ Notes: [[dsa/sliding-window/0567-permutation-in-string.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org]] +Notes: [[file:dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.org]] ** TODO 0076. Minimum Window Substring :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/minimum-window-substring/][Problem]] @@ -502,7 +502,7 @@ Notes: [[dsa/sliding-window/3306-count-of-substrings-containing-every-vowel-and- *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0076-minimum-window-substring.org]] +Notes: [[file:dsa/sliding-window/0076-minimum-window-substring.org]] ** TODO 0239. Sliding Window Maximum :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/sliding-window-maximum/][Problem]] @@ -513,7 +513,7 @@ Notes: [[dsa/sliding-window/0076-minimum-window-substring.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/sliding-window/0239-sliding-window-maximum.org]] +Notes: [[file:dsa/sliding-window/0239-sliding-window-maximum.org]] * TODO Linked List [/] @@ -527,7 +527,7 @@ Notes: [[dsa/sliding-window/0239-sliding-window-maximum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0206-reverse-linked-list.org]] +Notes: [[file:dsa/linked-list/0206-reverse-linked-list.org]] ** TODO 0021. Merge Two Sorted Lists :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/merge-two-sorted-lists/][Problem]] @@ -538,7 +538,7 @@ Notes: [[dsa/linked-list/0206-reverse-linked-list.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0021-merge-two-sorted-lists.org]] +Notes: [[file:dsa/linked-list/0021-merge-two-sorted-lists.org]] ** TODO 0141. Linked List Cycle :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/linked-list-cycle/][Problem]] @@ -549,7 +549,7 @@ Notes: [[dsa/linked-list/0021-merge-two-sorted-lists.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0141-linked-list-cycle.org]] +Notes: [[file:dsa/linked-list/0141-linked-list-cycle.org]] ** TODO 2487. Remove Nodes From Linked List :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/remove-nodes-from-linked-list/][Problem]] @@ -560,7 +560,7 @@ Notes: [[dsa/linked-list/0141-linked-list-cycle.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/2487-remove-nodes-from-linked-list.org]] +Notes: [[file:dsa/linked-list/2487-remove-nodes-from-linked-list.org]] ** TODO 0143. Reorder List :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/reorder-list/][Problem]] @@ -571,7 +571,7 @@ Notes: [[dsa/linked-list/2487-remove-nodes-from-linked-list.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0143-reorder-list.org]] +Notes: [[file:dsa/linked-list/0143-reorder-list.org]] ** TODO 0019. Remove Nth Node From End of List :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/remove-nth-node-from-end-of-list/][Problem]] @@ -582,7 +582,7 @@ Notes: [[dsa/linked-list/0143-reorder-list.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0019-remove-nth-node-from-end-of-list.org]] +Notes: [[file:dsa/linked-list/0019-remove-nth-node-from-end-of-list.org]] ** TODO 1721. Swapping Nodes in a Linked List :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/swapping-nodes-in-a-linked-list/][Problem]] @@ -593,7 +593,7 @@ Notes: [[dsa/linked-list/0019-remove-nth-node-from-end-of-list.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org]] +Notes: [[file:dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org]] ** TODO 0138. Copy List With Random Pointer :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/copy-list-with-random-pointer/][Problem]] @@ -604,7 +604,7 @@ Notes: [[dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0138-copy-list-with-random-pointer.org]] +Notes: [[file:dsa/linked-list/0138-copy-list-with-random-pointer.org]] ** TODO 1472. Design Browser History :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/design-browser-history/][Problem]] @@ -615,7 +615,7 @@ Notes: [[dsa/linked-list/0138-copy-list-with-random-pointer.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/1472-design-browser-history.org]] +Notes: [[file:dsa/linked-list/1472-design-browser-history.org]] ** TODO 0002. Add Two Numbers :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/add-two-numbers/][Problem]] @@ -626,7 +626,7 @@ Notes: [[dsa/linked-list/1472-design-browser-history.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0002-add-two-numbers.org]] +Notes: [[file:dsa/linked-list/0002-add-two-numbers.org]] ** TODO 0287. Find The Duplicate Number :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-the-duplicate-number/][Problem]] @@ -637,7 +637,7 @@ Notes: [[dsa/linked-list/0002-add-two-numbers.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0287-find-the-duplicate-number.org]] +Notes: [[file:dsa/linked-list/0287-find-the-duplicate-number.org]] ** TODO 0725. Split Linked List in Parts :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/split-linked-list-in-parts/][Problem]] @@ -648,7 +648,7 @@ Notes: [[dsa/linked-list/0287-find-the-duplicate-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0725-split-linked-list-in-parts.org]] +Notes: [[file:dsa/linked-list/0725-split-linked-list-in-parts.org]] ** TODO 0146. LRU Cache :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/lru-cache/][Problem]] @@ -659,7 +659,7 @@ Notes: [[dsa/linked-list/0725-split-linked-list-in-parts.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0146-lru-cache.org]] +Notes: [[file:dsa/linked-list/0146-lru-cache.org]] ** TODO 0023. Merge K Sorted Lists :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/merge-k-sorted-lists/][Problem]] @@ -670,7 +670,7 @@ Notes: [[dsa/linked-list/0146-lru-cache.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0023-merge-k-sorted-lists.org]] +Notes: [[file:dsa/linked-list/0023-merge-k-sorted-lists.org]] ** TODO 0025. Reverse Nodes In K Group :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/reverse-nodes-in-k-group/][Problem]] @@ -681,7 +681,7 @@ Notes: [[dsa/linked-list/0023-merge-k-sorted-lists.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/linked-list/0025-reverse-nodes-in-k-group.org]] +Notes: [[file:dsa/linked-list/0025-reverse-nodes-in-k-group.org]] * TODO Trees [/] @@ -695,7 +695,7 @@ Notes: [[dsa/linked-list/0025-reverse-nodes-in-k-group.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0590-n-ary-tree-postorder-traversal.org]] +Notes: [[file:dsa/trees/0590-n-ary-tree-postorder-traversal.org]] ** TODO 0226. Invert Binary Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/invert-binary-tree/][Problem]] @@ -706,7 +706,7 @@ Notes: [[dsa/trees/0590-n-ary-tree-postorder-traversal.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0226-invert-binary-tree.org]] +Notes: [[file:dsa/trees/0226-invert-binary-tree.org]] ** TODO 0104. Maximum Depth of Binary Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/maximum-depth-of-binary-tree/][Problem]] @@ -717,7 +717,7 @@ Notes: [[dsa/trees/0226-invert-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0104-maximum-depth-of-binary-tree.org]] +Notes: [[file:dsa/trees/0104-maximum-depth-of-binary-tree.org]] ** TODO 0543. Diameter of Binary Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/diameter-of-binary-tree/][Problem]] @@ -728,7 +728,7 @@ Notes: [[dsa/trees/0104-maximum-depth-of-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0543-diameter-of-binary-tree.org]] +Notes: [[file:dsa/trees/0543-diameter-of-binary-tree.org]] ** TODO 0110. Balanced Binary Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/balanced-binary-tree/][Problem]] @@ -739,7 +739,7 @@ Notes: [[dsa/trees/0543-diameter-of-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0110-balanced-binary-tree.org]] +Notes: [[file:dsa/trees/0110-balanced-binary-tree.org]] ** TODO 0100. Same Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/same-tree/][Problem]] @@ -750,7 +750,7 @@ Notes: [[dsa/trees/0110-balanced-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0100-same-tree.org]] +Notes: [[file:dsa/trees/0100-same-tree.org]] ** TODO 0572. Subtree of Another Tree :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/subtree-of-another-tree/][Problem]] @@ -761,7 +761,7 @@ Notes: [[dsa/trees/0100-same-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0572-subtree-of-another-tree.org]] +Notes: [[file:dsa/trees/0572-subtree-of-another-tree.org]] ** TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/][Problem]] @@ -772,7 +772,7 @@ Notes: [[dsa/trees/0572-subtree-of-another-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org]] +Notes: [[file:dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org]] ** TODO 0102. Binary Tree Level Order Traversal :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/binary-tree-level-order-traversal/][Problem]] @@ -783,7 +783,7 @@ Notes: [[dsa/trees/0235-lowest-common-ancestor-of-a-binary-search-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0102-binary-tree-level-order-traversal.org]] +Notes: [[file:dsa/trees/0102-binary-tree-level-order-traversal.org]] ** TODO 0199. Binary Tree Right Side View :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/binary-tree-right-side-view/][Problem]] @@ -794,7 +794,7 @@ Notes: [[dsa/trees/0102-binary-tree-level-order-traversal.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0199-binary-tree-right-side-view.org]] +Notes: [[file:dsa/trees/0199-binary-tree-right-side-view.org]] ** TODO 1376. Time Needed to Inform All Employees :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/time-needed-to-inform-all-employees/][Problem]] @@ -805,7 +805,7 @@ Notes: [[dsa/trees/0199-binary-tree-right-side-view.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/1376-time-needed-to-inform-all-employees.org]] +Notes: [[file:dsa/trees/1376-time-needed-to-inform-all-employees.org]] ** TODO 1448. Count Good Nodes In Binary Tree :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/count-good-nodes-in-binary-tree/][Problem]] @@ -816,7 +816,7 @@ Notes: [[dsa/trees/1376-time-needed-to-inform-all-employees.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/1448-count-good-nodes-in-binary-tree.org]] +Notes: [[file:dsa/trees/1448-count-good-nodes-in-binary-tree.org]] ** TODO 0098. Validate Binary Search Tree :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/validate-binary-search-tree/][Problem]] @@ -827,7 +827,7 @@ Notes: [[dsa/trees/1448-count-good-nodes-in-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0098-validate-binary-search-tree.org]] +Notes: [[file:dsa/trees/0098-validate-binary-search-tree.org]] ** TODO 0230. Kth Smallest Element In a Bst :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/kth-smallest-element-in-a-bst/][Problem]] @@ -838,7 +838,7 @@ Notes: [[dsa/trees/0098-validate-binary-search-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0230-kth-smallest-element-in-a-bst.org]] +Notes: [[file:dsa/trees/0230-kth-smallest-element-in-a-bst.org]] ** TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/][Problem]] @@ -849,7 +849,7 @@ Notes: [[dsa/trees/0230-kth-smallest-element-in-a-bst.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org]] +Notes: [[file:dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversal.org]] ** TODO 1028. Recover a Tree From Preorder Traversal :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/][Problem]] @@ -860,7 +860,7 @@ Notes: [[dsa/trees/0105-construct-binary-tree-from-preorder-and-inorder-traversa *** TODO Python *** TODO C++ -Notes: [[dsa/trees/1028-recover-a-tree-from-preorder-traversal.org]] +Notes: [[file:dsa/trees/1028-recover-a-tree-from-preorder-traversal.org]] ** TODO 0124. Binary Tree Maximum Path Sum :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/binary-tree-maximum-path-sum/][Problem]] @@ -871,7 +871,7 @@ Notes: [[dsa/trees/1028-recover-a-tree-from-preorder-traversal.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0124-binary-tree-maximum-path-sum.org]] +Notes: [[file:dsa/trees/0124-binary-tree-maximum-path-sum.org]] ** TODO 0297. Serialize And Deserialize Binary Tree :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/serialize-and-deserialize-binary-tree/][Problem]] @@ -882,7 +882,7 @@ Notes: [[dsa/trees/0124-binary-tree-maximum-path-sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/trees/0297-serialize-and-deserialize-binary-tree.org]] +Notes: [[file:dsa/trees/0297-serialize-and-deserialize-binary-tree.org]] * TODO Tries [/] @@ -896,7 +896,7 @@ Notes: [[dsa/trees/0297-serialize-and-deserialize-binary-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/tries/0208-implement-trie-prefix-tree.org]] +Notes: [[file:dsa/tries/0208-implement-trie-prefix-tree.org]] ** TODO 0211. Design Add And Search Words Data Structure :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/design-add-and-search-words-data-structure/][Problem]] @@ -907,7 +907,7 @@ Notes: [[dsa/tries/0208-implement-trie-prefix-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/tries/0211-design-add-and-search-words-data-structure.org]] +Notes: [[file:dsa/tries/0211-design-add-and-search-words-data-structure.org]] ** TODO 1166. Design File System :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/design-file-system/][Problem]] @@ -917,7 +917,7 @@ Notes: [[dsa/tries/0211-design-add-and-search-words-data-structure.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/tries/1166-design-file-system.org]] +Notes: [[file:dsa/tries/1166-design-file-system.org]] ** TODO 0212. Word Search II :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/word-search-ii/][Problem]] @@ -928,7 +928,7 @@ Notes: [[dsa/tries/1166-design-file-system.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/tries/0212-word-search-ii.org]] +Notes: [[file:dsa/tries/0212-word-search-ii.org]] * TODO Heap / Priority Queue [/] @@ -942,7 +942,7 @@ Notes: [[dsa/tries/0212-word-search-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org]] +Notes: [[file:dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org]] ** TODO 1046. Last Stone Weight :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/last-stone-weight/][Problem]] @@ -953,7 +953,7 @@ Notes: [[dsa/heap-priority-queue/0703-kth-largest-element-in-a-stream.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/1046-last-stone-weight.org]] +Notes: [[file:dsa/heap-priority-queue/1046-last-stone-weight.org]] ** TODO 0973. K Closest Points to Origin :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/k-closest-points-to-origin/][Problem]] @@ -964,7 +964,7 @@ Notes: [[dsa/heap-priority-queue/1046-last-stone-weight.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0973-k-closest-points-to-origin.org]] +Notes: [[file:dsa/heap-priority-queue/0973-k-closest-points-to-origin.org]] ** TODO 0215. Kth Largest Element In An Array :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/kth-largest-element-in-an-array/][Problem]] @@ -975,7 +975,7 @@ Notes: [[dsa/heap-priority-queue/0973-k-closest-points-to-origin.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org]] +Notes: [[file:dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org]] ** TODO 0621. Task Scheduler :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/task-scheduler/][Problem]] @@ -986,7 +986,7 @@ Notes: [[dsa/heap-priority-queue/0215-kth-largest-element-in-an-array.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0621-task-scheduler.org]] +Notes: [[file:dsa/heap-priority-queue/0621-task-scheduler.org]] ** TODO 0355. Design Twitter :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/design-twitter/][Problem]] @@ -997,7 +997,7 @@ Notes: [[dsa/heap-priority-queue/0621-task-scheduler.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0355-design-twitter.org]] +Notes: [[file:dsa/heap-priority-queue/0355-design-twitter.org]] ** TODO 0295. Find Median From Data Stream :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-median-from-data-stream/][Problem]] @@ -1008,7 +1008,7 @@ Notes: [[dsa/heap-priority-queue/0355-design-twitter.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/heap-priority-queue/0295-find-median-from-data-stream.org]] +Notes: [[file:dsa/heap-priority-queue/0295-find-median-from-data-stream.org]] * TODO Backtracking [/] @@ -1022,7 +1022,7 @@ Notes: [[dsa/heap-priority-queue/0295-find-median-from-data-stream.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/1863-sum-of-all-subset-xor-totals.org]] +Notes: [[file:dsa/backtracking/1863-sum-of-all-subset-xor-totals.org]] ** TODO 0078. Subsets :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/subsets/][Problem]] @@ -1033,7 +1033,7 @@ Notes: [[dsa/backtracking/1863-sum-of-all-subset-xor-totals.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0078-subsets.org]] +Notes: [[file:dsa/backtracking/0078-subsets.org]] ** TODO 0039. Combination Sum :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/combination-sum/][Problem]] @@ -1044,7 +1044,7 @@ Notes: [[dsa/backtracking/0078-subsets.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0039-combination-sum.org]] +Notes: [[file:dsa/backtracking/0039-combination-sum.org]] ** TODO 0040. Combination Sum II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/combination-sum-ii/][Problem]] @@ -1055,7 +1055,7 @@ Notes: [[dsa/backtracking/0039-combination-sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0040-combination-sum-ii.org]] +Notes: [[file:dsa/backtracking/0040-combination-sum-ii.org]] ** TODO 0077. Combinations :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/combinations/][Problem]] @@ -1066,7 +1066,7 @@ Notes: [[dsa/backtracking/0040-combination-sum-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0077-combinations.org]] +Notes: [[file:dsa/backtracking/0077-combinations.org]] ** TODO 0046. Permutations :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/permutations/][Problem]] @@ -1077,7 +1077,7 @@ Notes: [[dsa/backtracking/0077-combinations.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0046-permutations.org]] +Notes: [[file:dsa/backtracking/0046-permutations.org]] ** TODO 0090. Subsets II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/subsets-ii/][Problem]] @@ -1088,7 +1088,7 @@ Notes: [[dsa/backtracking/0046-permutations.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0090-subsets-ii.org]] +Notes: [[file:dsa/backtracking/0090-subsets-ii.org]] ** TODO 0022. Generate Parentheses :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/generate-parentheses/][Problem]] @@ -1099,7 +1099,7 @@ Notes: [[dsa/backtracking/0090-subsets-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0022-generate-parentheses.org]] +Notes: [[file:dsa/backtracking/0022-generate-parentheses.org]] ** TODO 1079. Letter Tile Possibilities :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/letter-tile-possibilities/][Problem]] @@ -1110,7 +1110,7 @@ Notes: [[dsa/backtracking/0022-generate-parentheses.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/1079-letter-tile-possibilities.org]] +Notes: [[file:dsa/backtracking/1079-letter-tile-possibilities.org]] ** TODO 0079. Word Search :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/word-search/][Problem]] @@ -1121,7 +1121,7 @@ Notes: [[dsa/backtracking/1079-letter-tile-possibilities.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0079-word-search.org]] +Notes: [[file:dsa/backtracking/0079-word-search.org]] ** TODO 0131. Palindrome Partitioning :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/palindrome-partitioning/][Problem]] @@ -1132,7 +1132,7 @@ Notes: [[dsa/backtracking/0079-word-search.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0131-palindrome-partitioning.org]] +Notes: [[file:dsa/backtracking/0131-palindrome-partitioning.org]] ** TODO 0017. Letter Combinations of a Phone Number :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/letter-combinations-of-a-phone-number/][Problem]] @@ -1143,7 +1143,7 @@ Notes: [[dsa/backtracking/0131-palindrome-partitioning.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0017-letter-combinations-of-a-phone-number.org]] +Notes: [[file:dsa/backtracking/0017-letter-combinations-of-a-phone-number.org]] ** TODO 0351. Android Unlock Patterns :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/android-unlock-patterns/][Problem]] @@ -1153,7 +1153,7 @@ Notes: [[dsa/backtracking/0017-letter-combinations-of-a-phone-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0351-android-unlock-patterns.org]] +Notes: [[file:dsa/backtracking/0351-android-unlock-patterns.org]] ** TODO 0051. N Queens :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/n-queens/][Problem]] @@ -1164,7 +1164,7 @@ Notes: [[dsa/backtracking/0351-android-unlock-patterns.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0051-n-queens.org]] +Notes: [[file:dsa/backtracking/0051-n-queens.org]] ** TODO 0052. N Queens II :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/n-queens-ii/][Problem]] @@ -1175,7 +1175,7 @@ Notes: [[dsa/backtracking/0051-n-queens.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/backtracking/0052-n-queens-ii.org]] +Notes: [[file:dsa/backtracking/0052-n-queens-ii.org]] * TODO Graphs [/] @@ -1189,7 +1189,7 @@ Notes: [[dsa/backtracking/0052-n-queens-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/2924-find-champion-ii.org]] +Notes: [[file:dsa/graphs/2924-find-champion-ii.org]] ** TODO 0200. Number of Islands :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/number-of-islands/][Problem]] @@ -1200,7 +1200,7 @@ Notes: [[dsa/graphs/2924-find-champion-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0200-number-of-islands.org]] +Notes: [[file:dsa/graphs/0200-number-of-islands.org]] ** TODO 0695. Max Area of Island :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/max-area-of-island/][Problem]] @@ -1211,7 +1211,7 @@ Notes: [[dsa/graphs/0200-number-of-islands.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0695-max-area-of-island.org]] +Notes: [[file:dsa/graphs/0695-max-area-of-island.org]] ** TODO 2658. Maximum Number of Fish in a Grid :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/][Problem]] @@ -1222,7 +1222,7 @@ Notes: [[dsa/graphs/0695-max-area-of-island.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org]] +Notes: [[file:dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org]] ** TODO 0133. Clone Graph :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/clone-graph/][Problem]] @@ -1233,7 +1233,7 @@ Notes: [[dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0133-clone-graph.org]] +Notes: [[file:dsa/graphs/0133-clone-graph.org]] ** TODO 0286. Walls And Gates :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/walls-and-gates/][Problem]] @@ -1244,7 +1244,7 @@ Notes: [[dsa/graphs/0133-clone-graph.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0286-walls-and-gates.org]] +Notes: [[file:dsa/graphs/0286-walls-and-gates.org]] ** TODO 0994. Rotting Oranges :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/rotting-oranges/][Problem]] @@ -1255,7 +1255,7 @@ Notes: [[dsa/graphs/0286-walls-and-gates.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0994-rotting-oranges.org]] +Notes: [[file:dsa/graphs/0994-rotting-oranges.org]] ** TODO 1905. Count Sub Islands :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/count-sub-islands/][Problem]] @@ -1266,7 +1266,7 @@ Notes: [[dsa/graphs/0994-rotting-oranges.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/1905-count-sub-islands.org]] +Notes: [[file:dsa/graphs/1905-count-sub-islands.org]] ** TODO 0417. Pacific Atlantic Water Flow :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/pacific-atlantic-water-flow/][Problem]] @@ -1277,7 +1277,7 @@ Notes: [[dsa/graphs/1905-count-sub-islands.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0417-pacific-atlantic-water-flow.org]] +Notes: [[file:dsa/graphs/0417-pacific-atlantic-water-flow.org]] ** TODO 0130. Surrounded Regions :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/surrounded-regions/][Problem]] @@ -1288,7 +1288,7 @@ Notes: [[dsa/graphs/0417-pacific-atlantic-water-flow.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0130-surrounded-regions.org]] +Notes: [[file:dsa/graphs/0130-surrounded-regions.org]] ** TODO 0802. Find Eventual Safe States :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-eventual-safe-states/][Problem]] @@ -1299,7 +1299,7 @@ Notes: [[dsa/graphs/0130-surrounded-regions.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0802-find-eventual-safe-states.org]] +Notes: [[file:dsa/graphs/0802-find-eventual-safe-states.org]] ** TODO 0207. Course Schedule :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/course-schedule/][Problem]] @@ -1310,7 +1310,7 @@ Notes: [[dsa/graphs/0802-find-eventual-safe-states.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0207-course-schedule.org]] +Notes: [[file:dsa/graphs/0207-course-schedule.org]] ** TODO 0210. Course Schedule II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/course-schedule-ii/][Problem]] @@ -1321,7 +1321,7 @@ Notes: [[dsa/graphs/0207-course-schedule.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0210-course-schedule-ii.org]] +Notes: [[file:dsa/graphs/0210-course-schedule-ii.org]] ** TODO 0261. Graph Valid Tree :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/graph-valid-tree/][Problem]] @@ -1332,7 +1332,7 @@ Notes: [[dsa/graphs/0210-course-schedule-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0261-graph-valid-tree.org]] +Notes: [[file:dsa/graphs/0261-graph-valid-tree.org]] ** TODO 0323. Number of Connected Components In An Undirected Graph :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/][Problem]] @@ -1343,7 +1343,7 @@ Notes: [[dsa/graphs/0261-graph-valid-tree.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org]] +Notes: [[file:dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.org]] ** TODO 0684. Redundant Connection :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/redundant-connection/][Problem]] @@ -1354,7 +1354,7 @@ Notes: [[dsa/graphs/0323-number-of-connected-components-in-an-undirected-graph.o *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0684-redundant-connection.org]] +Notes: [[file:dsa/graphs/0684-redundant-connection.org]] ** TODO 2092. Find All People With Secret :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-all-people-with-secret/][Problem]] @@ -1365,7 +1365,7 @@ Notes: [[dsa/graphs/0684-redundant-connection.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/2092-find-all-people-with-secret.org]] +Notes: [[file:dsa/graphs/2092-find-all-people-with-secret.org]] ** TODO 0127. Word Ladder :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/word-ladder/][Problem]] @@ -1376,7 +1376,7 @@ Notes: [[dsa/graphs/2092-find-all-people-with-secret.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/graphs/0127-word-ladder.org]] +Notes: [[file:dsa/graphs/0127-word-ladder.org]] * TODO 1-D Dynamic Programming [/] @@ -1390,7 +1390,7 @@ Notes: [[dsa/graphs/0127-word-ladder.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0070-climbing-stairs.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0070-climbing-stairs.org]] ** TODO 0746. Min Cost Climbing Stairs :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/min-cost-climbing-stairs/][Problem]] @@ -1401,7 +1401,7 @@ Notes: [[dsa/1-d-dynamic-programming/0070-climbing-stairs.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org]] ** TODO 0198. House Robber :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/house-robber/][Problem]] @@ -1412,7 +1412,7 @@ Notes: [[dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0198-house-robber.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0198-house-robber.org]] ** TODO 0213. House Robber II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/house-robber-ii/][Problem]] @@ -1423,7 +1423,7 @@ Notes: [[dsa/1-d-dynamic-programming/0198-house-robber.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0213-house-robber-ii.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0213-house-robber-ii.org]] ** TODO 0005. Longest Palindromic Substring :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-palindromic-substring/][Problem]] @@ -1434,7 +1434,7 @@ Notes: [[dsa/1-d-dynamic-programming/0213-house-robber-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org]] ** TODO 0647. Palindromic Substrings :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/palindromic-substrings/][Problem]] @@ -1445,7 +1445,7 @@ Notes: [[dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0647-palindromic-substrings.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0647-palindromic-substrings.org]] ** TODO 0091. Decode Ways :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/decode-ways/][Problem]] @@ -1456,7 +1456,7 @@ Notes: [[dsa/1-d-dynamic-programming/0647-palindromic-substrings.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0091-decode-ways.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0091-decode-ways.org]] ** TODO 0322. Coin Change :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/coin-change/][Problem]] @@ -1467,7 +1467,7 @@ Notes: [[dsa/1-d-dynamic-programming/0091-decode-ways.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0322-coin-change.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0322-coin-change.org]] ** TODO 0152. Maximum Product Subarray :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/maximum-product-subarray/][Problem]] @@ -1478,7 +1478,7 @@ Notes: [[dsa/1-d-dynamic-programming/0322-coin-change.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org]] ** TODO 0139. Word Break :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/word-break/][Problem]] @@ -1489,7 +1489,7 @@ Notes: [[dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0139-word-break.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0139-word-break.org]] ** TODO 0300. Longest Increasing Subsequence :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-increasing-subsequence/][Problem]] @@ -1500,7 +1500,7 @@ Notes: [[dsa/1-d-dynamic-programming/0139-word-break.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org]] ** TODO 0416. Partition Equal Subset Sum :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/partition-equal-subset-sum/][Problem]] @@ -1511,7 +1511,7 @@ Notes: [[dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org]] ** TODO 0656. Coin Path :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/coin-path/][Problem]] @@ -1521,7 +1521,7 @@ Notes: [[dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/1-d-dynamic-programming/0656-coin-path.org]] +Notes: [[file:dsa/1-d-dynamic-programming/0656-coin-path.org]] * TODO Intervals [/] @@ -1535,7 +1535,7 @@ Notes: [[dsa/1-d-dynamic-programming/0656-coin-path.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0057-insert-interval.org]] +Notes: [[file:dsa/intervals/0057-insert-interval.org]] ** TODO 0056. Merge Intervals :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/merge-intervals/][Problem]] @@ -1546,7 +1546,7 @@ Notes: [[dsa/intervals/0057-insert-interval.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0056-merge-intervals.org]] +Notes: [[file:dsa/intervals/0056-merge-intervals.org]] ** TODO 0435. Non Overlapping Intervals :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/non-overlapping-intervals/][Problem]] @@ -1557,7 +1557,7 @@ Notes: [[dsa/intervals/0056-merge-intervals.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0435-non-overlapping-intervals.org]] +Notes: [[file:dsa/intervals/0435-non-overlapping-intervals.org]] ** TODO 0986. Interval List Intersections :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/interval-list-intersections/][Problem]] @@ -1567,7 +1567,7 @@ Notes: [[dsa/intervals/0435-non-overlapping-intervals.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0986-interval-list-intersections.org]] +Notes: [[file:dsa/intervals/0986-interval-list-intersections.org]] ** TODO 0252. Meeting Rooms :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/meeting-rooms/][Problem]] @@ -1578,7 +1578,7 @@ Notes: [[dsa/intervals/0986-interval-list-intersections.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0252-meeting-rooms.org]] +Notes: [[file:dsa/intervals/0252-meeting-rooms.org]] ** TODO 0253. Meeting Rooms II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/meeting-rooms-ii/][Problem]] @@ -1589,7 +1589,7 @@ Notes: [[dsa/intervals/0252-meeting-rooms.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/0253-meeting-rooms-ii.org]] +Notes: [[file:dsa/intervals/0253-meeting-rooms-ii.org]] ** TODO 1851. Minimum Interval to Include Each Query :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/minimum-interval-to-include-each-query/][Problem]] @@ -1600,7 +1600,7 @@ Notes: [[dsa/intervals/0253-meeting-rooms-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/intervals/1851-minimum-interval-to-include-each-query.org]] +Notes: [[file:dsa/intervals/1851-minimum-interval-to-include-each-query.org]] * TODO Greedy [/] @@ -1614,7 +1614,7 @@ Notes: [[dsa/intervals/1851-minimum-interval-to-include-each-query.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0945-minimum-increment-to-make-array-unique.org]] +Notes: [[file:dsa/greedy/0945-minimum-increment-to-make-array-unique.org]] ** TODO 0053. Maximum Subarray :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/maximum-subarray/][Problem]] @@ -1625,7 +1625,7 @@ Notes: [[dsa/greedy/0945-minimum-increment-to-make-array-unique.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0053-maximum-subarray.org]] +Notes: [[file:dsa/greedy/0053-maximum-subarray.org]] ** TODO 0978. Longest Turbulent Subarray :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-turbulent-subarray/][Problem]] @@ -1636,7 +1636,7 @@ Notes: [[dsa/greedy/0053-maximum-subarray.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0978-longest-turbulent-subarray.org]] +Notes: [[file:dsa/greedy/0978-longest-turbulent-subarray.org]] ** TODO 0055. Jump Game :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/jump-game/][Problem]] @@ -1647,7 +1647,7 @@ Notes: [[dsa/greedy/0978-longest-turbulent-subarray.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0055-jump-game.org]] +Notes: [[file:dsa/greedy/0055-jump-game.org]] ** TODO 0045. Jump Game II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/jump-game-ii/][Problem]] @@ -1658,7 +1658,7 @@ Notes: [[dsa/greedy/0055-jump-game.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0045-jump-game-ii.org]] +Notes: [[file:dsa/greedy/0045-jump-game-ii.org]] ** TODO 1871. Jump Game VII :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/jump-game-vii/][Problem]] @@ -1669,7 +1669,7 @@ Notes: [[dsa/greedy/0045-jump-game-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/1871-jump-game-vii.org]] +Notes: [[file:dsa/greedy/1871-jump-game-vii.org]] ** TODO 0134. Gas Station :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/gas-station/][Problem]] @@ -1680,7 +1680,7 @@ Notes: [[dsa/greedy/1871-jump-game-vii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0134-gas-station.org]] +Notes: [[file:dsa/greedy/0134-gas-station.org]] ** TODO 0846. Hand of Straights :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/hand-of-straights/][Problem]] @@ -1691,7 +1691,7 @@ Notes: [[dsa/greedy/0134-gas-station.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0846-hand-of-straights.org]] +Notes: [[file:dsa/greedy/0846-hand-of-straights.org]] ** TODO 1899. Merge Triplets to Form Target Triplet :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/merge-triplets-to-form-target-triplet/][Problem]] @@ -1702,7 +1702,7 @@ Notes: [[dsa/greedy/0846-hand-of-straights.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/1899-merge-triplets-to-form-target-triplet.org]] +Notes: [[file:dsa/greedy/1899-merge-triplets-to-form-target-triplet.org]] ** TODO 0763. Partition Labels :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/partition-labels/][Problem]] @@ -1713,7 +1713,7 @@ Notes: [[dsa/greedy/1899-merge-triplets-to-form-target-triplet.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0763-partition-labels.org]] +Notes: [[file:dsa/greedy/0763-partition-labels.org]] ** TODO 0678. Valid Parenthesis String :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-parenthesis-string/][Problem]] @@ -1724,7 +1724,7 @@ Notes: [[dsa/greedy/0763-partition-labels.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/greedy/0678-valid-parenthesis-string.org]] +Notes: [[file:dsa/greedy/0678-valid-parenthesis-string.org]] * TODO Advanced Graphs [/] @@ -1738,7 +1738,7 @@ Notes: [[dsa/greedy/0678-valid-parenthesis-string.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/0743-network-delay-time.org]] +Notes: [[file:dsa/advanced-graphs/0743-network-delay-time.org]] ** TODO 0332. Reconstruct Itinerary :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/reconstruct-itinerary/][Problem]] @@ -1749,7 +1749,7 @@ Notes: [[dsa/advanced-graphs/0743-network-delay-time.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/0332-reconstruct-itinerary.org]] +Notes: [[file:dsa/advanced-graphs/0332-reconstruct-itinerary.org]] ** TODO 1584. Min Cost to Connect All Points :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/min-cost-to-connect-all-points/][Problem]] @@ -1760,7 +1760,7 @@ Notes: [[dsa/advanced-graphs/0332-reconstruct-itinerary.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org]] +Notes: [[file:dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org]] ** TODO 2812. Find the Safest Path in a Grid :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-the-safest-path-in-a-grid/][Problem]] @@ -1771,7 +1771,7 @@ Notes: [[dsa/advanced-graphs/1584-min-cost-to-connect-all-points.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org]] +Notes: [[file:dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org]] ** TODO 0778. Swim In Rising Water :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/swim-in-rising-water/][Problem]] @@ -1782,7 +1782,7 @@ Notes: [[dsa/advanced-graphs/2812-find-the-safest-path-in-a-grid.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/0778-swim-in-rising-water.org]] +Notes: [[file:dsa/advanced-graphs/0778-swim-in-rising-water.org]] ** TODO 0269. Alien Dictionary :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/alien-dictionary/][Problem]] @@ -1793,7 +1793,7 @@ Notes: [[dsa/advanced-graphs/0778-swim-in-rising-water.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/0269-alien-dictionary.org]] +Notes: [[file:dsa/advanced-graphs/0269-alien-dictionary.org]] ** TODO 0787. Cheapest Flights Within K Stops :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/cheapest-flights-within-k-stops/][Problem]] @@ -1804,7 +1804,7 @@ Notes: [[dsa/advanced-graphs/0269-alien-dictionary.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org]] +Notes: [[file:dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org]] ** TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/][Problem]] @@ -1815,7 +1815,7 @@ Notes: [[dsa/advanced-graphs/0787-cheapest-flights-within-k-stops.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org]] +Notes: [[file:dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups.org]] * TODO Bit Manipulation [/] @@ -1829,7 +1829,7 @@ Notes: [[dsa/advanced-graphs/2493-divide-nodes-into-the-maximum-number-of-groups *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0136-single-number.org]] +Notes: [[file:dsa/bit-manipulation/0136-single-number.org]] ** TODO 0260. Single Number III :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/single-number-iii/][Problem]] @@ -1840,7 +1840,7 @@ Notes: [[dsa/bit-manipulation/0136-single-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0260-single-number-iii.org]] +Notes: [[file:dsa/bit-manipulation/0260-single-number-iii.org]] ** TODO 0191. Number of 1 Bits :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/number-of-1-bits/][Problem]] @@ -1851,7 +1851,7 @@ Notes: [[dsa/bit-manipulation/0260-single-number-iii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0191-number-of-1-bits.org]] +Notes: [[file:dsa/bit-manipulation/0191-number-of-1-bits.org]] ** TODO 0338. Counting Bits :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/counting-bits/][Problem]] @@ -1862,7 +1862,7 @@ Notes: [[dsa/bit-manipulation/0191-number-of-1-bits.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0338-counting-bits.org]] +Notes: [[file:dsa/bit-manipulation/0338-counting-bits.org]] ** TODO 2220. Minimum Bit Flips to Convert Number :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/minimum-bit-flips-to-convert-number/][Problem]] @@ -1873,7 +1873,7 @@ Notes: [[dsa/bit-manipulation/0338-counting-bits.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org]] +Notes: [[file:dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org]] ** TODO 0190. Reverse Bits :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/reverse-bits/][Problem]] @@ -1884,7 +1884,7 @@ Notes: [[dsa/bit-manipulation/2220-minimum-bit-flips-to-convert-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0190-reverse-bits.org]] +Notes: [[file:dsa/bit-manipulation/0190-reverse-bits.org]] ** TODO 0268. Missing Number :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/missing-number/][Problem]] @@ -1895,7 +1895,7 @@ Notes: [[dsa/bit-manipulation/0190-reverse-bits.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0268-missing-number.org]] +Notes: [[file:dsa/bit-manipulation/0268-missing-number.org]] ** TODO 0231. Power of Two :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/power-of-two/][Problem]] @@ -1906,7 +1906,7 @@ Notes: [[dsa/bit-manipulation/0268-missing-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0231-power-of-two.org]] +Notes: [[file:dsa/bit-manipulation/0231-power-of-two.org]] ** TODO 0371. Sum of Two Integers :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/sum-of-two-integers/][Problem]] @@ -1917,7 +1917,7 @@ Notes: [[dsa/bit-manipulation/0231-power-of-two.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0371-sum-of-two-integers.org]] +Notes: [[file:dsa/bit-manipulation/0371-sum-of-two-integers.org]] ** TODO 0007. Reverse Integer :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/reverse-integer/][Problem]] @@ -1928,7 +1928,7 @@ Notes: [[dsa/bit-manipulation/0371-sum-of-two-integers.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/bit-manipulation/0007-reverse-integer.org]] +Notes: [[file:dsa/bit-manipulation/0007-reverse-integer.org]] * TODO Math & Geometry [/] @@ -1942,7 +1942,7 @@ Notes: [[dsa/bit-manipulation/0007-reverse-integer.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0840-magic-squares-in-grid.org]] +Notes: [[file:dsa/math-geometry/0840-magic-squares-in-grid.org]] ** TODO 0048. Rotate Image :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/rotate-image/][Problem]] @@ -1953,7 +1953,7 @@ Notes: [[dsa/math-geometry/0840-magic-squares-in-grid.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0048-rotate-image.org]] +Notes: [[file:dsa/math-geometry/0048-rotate-image.org]] ** TODO 0054. Spiral Matrix :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/spiral-matrix/][Problem]] @@ -1964,7 +1964,7 @@ Notes: [[dsa/math-geometry/0048-rotate-image.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0054-spiral-matrix.org]] +Notes: [[file:dsa/math-geometry/0054-spiral-matrix.org]] ** TODO 2326. Spiral Matrix IV :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/spiral-matrix-iv/][Problem]] @@ -1975,7 +1975,7 @@ Notes: [[dsa/math-geometry/0054-spiral-matrix.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/2326-spiral-matrix-iv.org]] +Notes: [[file:dsa/math-geometry/2326-spiral-matrix-iv.org]] ** TODO 0073. Set Matrix Zeroes :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/set-matrix-zeroes/][Problem]] @@ -1986,7 +1986,7 @@ Notes: [[dsa/math-geometry/2326-spiral-matrix-iv.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0073-set-matrix-zeroes.org]] +Notes: [[file:dsa/math-geometry/0073-set-matrix-zeroes.org]] ** TODO 0202. Happy Number :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/happy-number/][Problem]] @@ -1997,7 +1997,7 @@ Notes: [[dsa/math-geometry/0073-set-matrix-zeroes.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0202-happy-number.org]] +Notes: [[file:dsa/math-geometry/0202-happy-number.org]] ** TODO 0066. Plus One :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/plus-one/][Problem]] @@ -2008,7 +2008,7 @@ Notes: [[dsa/math-geometry/0202-happy-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0066-plus-one.org]] +Notes: [[file:dsa/math-geometry/0066-plus-one.org]] ** TODO 0009. Palindrome Number :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/palindrome-number/][Problem]] @@ -2019,7 +2019,7 @@ Notes: [[dsa/math-geometry/0066-plus-one.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0009-palindrome-number.org]] +Notes: [[file:dsa/math-geometry/0009-palindrome-number.org]] ** TODO 0012. Integer to Roman :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/integer-to-roman/][Problem]] @@ -2030,7 +2030,7 @@ Notes: [[dsa/math-geometry/0009-palindrome-number.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0012-integer-to-roman.org]] +Notes: [[file:dsa/math-geometry/0012-integer-to-roman.org]] ** TODO 0050. Pow(x, n) :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/powx-n/][Problem]] @@ -2041,7 +2041,7 @@ Notes: [[dsa/math-geometry/0012-integer-to-roman.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0050-powx-n.org]] +Notes: [[file:dsa/math-geometry/0050-powx-n.org]] ** TODO 2698. Find the Punishment Number of an Integer :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/find-the-punishment-number-of-an-integer/][Problem]] @@ -2052,7 +2052,7 @@ Notes: [[dsa/math-geometry/0050-powx-n.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org]] +Notes: [[file:dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org]] ** TODO 1780. Check if Number is a Sum of Powers of Three :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/][Problem]] @@ -2063,7 +2063,7 @@ Notes: [[dsa/math-geometry/2698-find-the-punishment-number-of-an-integer.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org]] +Notes: [[file:dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org]] ** TODO 0043. Multiply Strings :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/multiply-strings/][Problem]] @@ -2074,7 +2074,7 @@ Notes: [[dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0043-multiply-strings.org]] +Notes: [[file:dsa/math-geometry/0043-multiply-strings.org]] ** TODO 2013. Detect Squares :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/detect-squares/][Problem]] @@ -2085,7 +2085,7 @@ Notes: [[dsa/math-geometry/0043-multiply-strings.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/2013-detect-squares.org]] +Notes: [[file:dsa/math-geometry/2013-detect-squares.org]] ** TODO 0296. Best Meeting Point :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/best-meeting-point/][Problem]] @@ -2095,7 +2095,7 @@ Notes: [[dsa/math-geometry/2013-detect-squares.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/math-geometry/0296-best-meeting-point.org]] +Notes: [[file:dsa/math-geometry/0296-best-meeting-point.org]] * TODO 2-D Dynamic Programming [/] @@ -2109,7 +2109,7 @@ Notes: [[dsa/math-geometry/0296-best-meeting-point.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0062-unique-paths.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0062-unique-paths.org]] ** TODO 1143. Longest Common Subsequence :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-common-subsequence/][Problem]] @@ -2120,7 +2120,7 @@ Notes: [[dsa/2-d-dynamic-programming/0062-unique-paths.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org]] +Notes: [[file:dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org]] ** TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/][Problem]] @@ -2131,7 +2131,7 @@ Notes: [[dsa/2-d-dynamic-programming/1143-longest-common-subsequence.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-cooldown.org]] ** TODO 0518. Coin Change II :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/coin-change-ii/][Problem]] @@ -2142,7 +2142,7 @@ Notes: [[dsa/2-d-dynamic-programming/0309-best-time-to-buy-and-sell-stock-with-c *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0518-coin-change-ii.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0518-coin-change-ii.org]] ** TODO 0494. Target Sum :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/target-sum/][Problem]] @@ -2153,7 +2153,7 @@ Notes: [[dsa/2-d-dynamic-programming/0518-coin-change-ii.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0494-target-sum.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0494-target-sum.org]] ** TODO 0097. Interleaving String :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/interleaving-string/][Problem]] @@ -2164,7 +2164,7 @@ Notes: [[dsa/2-d-dynamic-programming/0494-target-sum.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0097-interleaving-string.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0097-interleaving-string.org]] ** TODO 0329. Longest Increasing Path In a Matrix :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/longest-increasing-path-in-a-matrix/][Problem]] @@ -2175,7 +2175,7 @@ Notes: [[dsa/2-d-dynamic-programming/0097-interleaving-string.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.org]] ** TODO 1911. Maximum Alternating Subsequence Sum :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/maximum-alternating-subsequence-sum/][Problem]] @@ -2186,7 +2186,7 @@ Notes: [[dsa/2-d-dynamic-programming/0329-longest-increasing-path-in-a-matrix.or *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org]] +Notes: [[file:dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org]] ** TODO 0115. Distinct Subsequences :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/distinct-subsequences/][Problem]] @@ -2197,7 +2197,7 @@ Notes: [[dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.or *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0115-distinct-subsequences.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0115-distinct-subsequences.org]] ** TODO 0072. Edit Distance :medium: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/edit-distance/][Problem]] @@ -2208,7 +2208,7 @@ Notes: [[dsa/2-d-dynamic-programming/0115-distinct-subsequences.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0072-edit-distance.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0072-edit-distance.org]] ** TODO 1220. Count Vowels Permutation :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/count-vowels-permutation/][Problem]] @@ -2219,7 +2219,7 @@ Notes: [[dsa/2-d-dynamic-programming/0072-edit-distance.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org]] +Notes: [[file:dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org]] ** TODO 0312. Burst Balloons :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/burst-balloons/][Problem]] @@ -2230,7 +2230,7 @@ Notes: [[dsa/2-d-dynamic-programming/1220-count-vowels-permutation.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0312-burst-balloons.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0312-burst-balloons.org]] ** TODO 0010. Regular Expression Matching :hard: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/regular-expression-matching/][Problem]] @@ -2241,4 +2241,4 @@ Notes: [[dsa/2-d-dynamic-programming/0312-burst-balloons.org]] *** TODO Python *** TODO C++ -Notes: [[dsa/2-d-dynamic-programming/0010-regular-expression-matching.org]] +Notes: [[file:dsa/2-d-dynamic-programming/0010-regular-expression-matching.org]]