From e798e449bde97d736b2893eb9b3a1551b88d8d73 Mon Sep 17 00:00:00 2001 From: Wong Ding Feng Date: Mon, 1 Jun 2026 17:12:10 +0800 Subject: [PATCH] fix: move #+PROPERTY: STUDY_DECK_02 to top of file Org-mode requires global file properties before the first headline. Moved PROPERTY line above the * TODO heading in all 199 note files and updated scaffold-notes.mjs template. --- leetcode/scaffold-notes.mjs | 4 ++-- .../0005-longest-palindromic-substring.org | 2 +- .../dsa/1-d-dynamic-programming/0070-climbing-stairs.org | 2 +- .../dsa/1-d-dynamic-programming/0091-decode-ways.org | 2 +- .../dsa/1-d-dynamic-programming/0139-word-break.org | 2 +- .../1-d-dynamic-programming/0152-maximum-product-subarray.org | 2 +- .../dsa/1-d-dynamic-programming/0198-house-robber.org | 2 +- .../dsa/1-d-dynamic-programming/0213-house-robber-ii.org | 2 +- .../0300-longest-increasing-subsequence.org | 2 +- .../dsa/1-d-dynamic-programming/0322-coin-change.org | 2 +- .../0416-partition-equal-subset-sum.org | 2 +- .../1-d-dynamic-programming/0647-palindromic-substrings.org | 2 +- .../dsa/1-d-dynamic-programming/0656-coin-path.org | 2 +- .../1-d-dynamic-programming/0746-min-cost-climbing-stairs.org | 2 +- .../0010-regular-expression-matching.org | 2 +- .../dsa/2-d-dynamic-programming/0062-unique-paths.org | 2 +- .../dsa/2-d-dynamic-programming/0072-edit-distance.org | 2 +- .../dsa/2-d-dynamic-programming/0097-interleaving-string.org | 2 +- .../2-d-dynamic-programming/0115-distinct-subsequences.org | 2 +- .../0309-best-time-to-buy-and-sell-stock-with-cooldown.org | 2 +- .../dsa/2-d-dynamic-programming/0312-burst-balloons.org | 2 +- .../0329-longest-increasing-path-in-a-matrix.org | 2 +- .../dsa/2-d-dynamic-programming/0494-target-sum.org | 2 +- .../dsa/2-d-dynamic-programming/0518-coin-change-ii.org | 2 +- .../1143-longest-common-subsequence.org | 2 +- .../2-d-dynamic-programming/1220-count-vowels-permutation.org | 2 +- .../1911-maximum-alternating-subsequence-sum.org | 2 +- .../dsa/advanced-graphs/0269-alien-dictionary.org | 2 +- .../dsa/advanced-graphs/0332-reconstruct-itinerary.org | 2 +- .../dsa/advanced-graphs/0743-network-delay-time.org | 2 +- .../dsa/advanced-graphs/0778-swim-in-rising-water.org | 2 +- .../advanced-graphs/0787-cheapest-flights-within-k-stops.org | 2 +- .../advanced-graphs/1584-min-cost-to-connect-all-points.org | 2 +- .../2493-divide-nodes-into-the-maximum-number-of-groups.org | 2 +- .../advanced-graphs/2812-find-the-safest-path-in-a-grid.org | 2 +- org/study_deck_02/dsa/arrays-hashing/0001-two-sum.org | 2 +- org/study_deck_02/dsa/arrays-hashing/0036-valid-sudoku.org | 2 +- org/study_deck_02/dsa/arrays-hashing/0049-group-anagrams.org | 2 +- .../dsa/arrays-hashing/0128-longest-consecutive-sequence.org | 2 +- .../dsa/arrays-hashing/0217-contains-duplicate.org | 2 +- .../dsa/arrays-hashing/0238-product-of-array-except-self.org | 2 +- org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org | 2 +- .../dsa/arrays-hashing/0271-encode-and-decode-strings.org | 2 +- .../dsa/arrays-hashing/0347-top-k-frequent-elements.org | 2 +- .../dsa/arrays-hashing/1408-string-matching-in-an-array.org | 2 +- ...mum-number-of-operations-to-move-all-balls-to-each-box.org | 2 +- .../dsa/arrays-hashing/2678-number-of-senior-citizens.org | 2 +- .../0017-letter-combinations-of-a-phone-number.org | 2 +- .../dsa/backtracking/0022-generate-parentheses.org | 2 +- org/study_deck_02/dsa/backtracking/0039-combination-sum.org | 2 +- .../dsa/backtracking/0040-combination-sum-ii.org | 2 +- org/study_deck_02/dsa/backtracking/0046-permutations.org | 2 +- org/study_deck_02/dsa/backtracking/0051-n-queens.org | 2 +- org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org | 2 +- org/study_deck_02/dsa/backtracking/0077-combinations.org | 2 +- org/study_deck_02/dsa/backtracking/0078-subsets.org | 2 +- org/study_deck_02/dsa/backtracking/0079-word-search.org | 2 +- org/study_deck_02/dsa/backtracking/0090-subsets-ii.org | 2 +- .../dsa/backtracking/0131-palindrome-partitioning.org | 2 +- .../dsa/backtracking/0351-android-unlock-patterns.org | 2 +- .../dsa/backtracking/1079-letter-tile-possibilities.org | 2 +- .../dsa/backtracking/1863-sum-of-all-subsets-xor-total.org | 2 +- .../dsa/binary-search/0004-median-of-two-sorted-arrays.org | 2 +- .../dsa/binary-search/0033-search-in-rotated-sorted-array.org | 2 +- .../dsa/binary-search/0074-search-a-2d-matrix.org | 2 +- .../0153-find-minimum-in-rotated-sorted-array.org | 2 +- org/study_deck_02/dsa/binary-search/0704-binary-search.org | 2 +- .../binary-search/0719-find-k-th-smallest-pair-distance.org | 2 +- .../dsa/binary-search/0875-koko-eating-bananas.org | 2 +- .../dsa/binary-search/0981-time-based-key-value-store.org | 2 +- .../2300-successful-pairs-of-spells-and-potions.org | 2 +- .../dsa/bit-manipulation/0007-reverse-integer.org | 2 +- org/study_deck_02/dsa/bit-manipulation/0136-single-number.org | 2 +- org/study_deck_02/dsa/bit-manipulation/0190-reverse-bits.org | 2 +- .../dsa/bit-manipulation/0191-number-of-1-bits.org | 2 +- org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org | 2 +- .../dsa/bit-manipulation/0260-single-number-iii.org | 2 +- .../dsa/bit-manipulation/0268-missing-number.org | 2 +- org/study_deck_02/dsa/bit-manipulation/0338-counting-bits.org | 2 +- .../dsa/bit-manipulation/0371-sum-of-two-integers.org | 2 +- .../2220-minimum-bit-flips-to-convert-number.org | 2 +- org/study_deck_02/dsa/graphs/0127-word-ladder.org | 2 +- org/study_deck_02/dsa/graphs/0130-surrounded-regions.org | 2 +- org/study_deck_02/dsa/graphs/0133-clone-graph.org | 2 +- org/study_deck_02/dsa/graphs/0200-number-of-islands.org | 2 +- org/study_deck_02/dsa/graphs/0207-course-schedule.org | 2 +- org/study_deck_02/dsa/graphs/0210-course-schedule-ii.org | 2 +- org/study_deck_02/dsa/graphs/0261-graph-valid-tree.org | 2 +- org/study_deck_02/dsa/graphs/0286-walls-and-gates.org | 2 +- ...-number-of-connected-components-in-an-undirected-graph.org | 2 +- .../dsa/graphs/0417-pacific-atlantic-water-flow.org | 2 +- org/study_deck_02/dsa/graphs/0684-redundant-connection.org | 2 +- org/study_deck_02/dsa/graphs/0695-max-area-of-island.org | 2 +- .../dsa/graphs/0802-find-eventual-safe-states.org | 2 +- org/study_deck_02/dsa/graphs/0994-rotting-oranges.org | 2 +- org/study_deck_02/dsa/graphs/1905-count-sub-islands.org | 2 +- .../dsa/graphs/2092-find-all-people-with-secret.org | 2 +- .../dsa/graphs/2658-maximum-number-of-fish-in-a-grid.org | 2 +- org/study_deck_02/dsa/graphs/2924-find-champion-ii.org | 2 +- org/study_deck_02/dsa/greedy/0045-jump-game-ii.org | 2 +- org/study_deck_02/dsa/greedy/0053-maximum-subarray.org | 2 +- org/study_deck_02/dsa/greedy/0055-jump-game.org | 2 +- org/study_deck_02/dsa/greedy/0134-gas-station.org | 2 +- .../dsa/greedy/0678-valid-parenthesis-string.org | 2 +- org/study_deck_02/dsa/greedy/0763-partition-labels.org | 2 +- org/study_deck_02/dsa/greedy/0846-hand-of-straights.org | 2 +- .../greedy/0945-minimum-increment-to-make-array-unique.org | 2 +- .../dsa/greedy/0978-longest-turbulent-subarray.org | 2 +- org/study_deck_02/dsa/greedy/1871-jump-game-vii.org | 2 +- .../dsa/greedy/1899-merge-triplets-to-form-target-triplet.org | 2 +- .../0215-kth-largest-element-in-an-array.org | 2 +- .../heap-priority-queue/0295-find-median-from-data-stream.org | 2 +- .../dsa/heap-priority-queue/0355-design-twitter.org | 2 +- .../dsa/heap-priority-queue/0621-task-scheduler.org | 2 +- .../0703-kth-largest-element-in-a-stream.org | 2 +- .../heap-priority-queue/0973-k-closest-points-to-origin.org | 2 +- .../dsa/heap-priority-queue/1046-last-stone-weight.org | 2 +- org/study_deck_02/dsa/intervals/0056-merge-intervals.org | 2 +- org/study_deck_02/dsa/intervals/0057-insert-interval.org | 2 +- org/study_deck_02/dsa/intervals/0252-meeting-rooms.org | 2 +- org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org | 2 +- .../dsa/intervals/0435-non-overlapping-intervals.org | 2 +- .../dsa/intervals/0986-interval-list-intersections.org | 2 +- .../intervals/1851-minimum-interval-to-include-each-query.org | 2 +- org/study_deck_02/dsa/linked-list/0002-add-two-numbers.org | 2 +- .../dsa/linked-list/0019-remove-nth-node-from-end-of-list.org | 2 +- .../dsa/linked-list/0021-merge-two-sorted-lists.org | 2 +- .../dsa/linked-list/0023-merge-k-sorted-lists.org | 2 +- .../dsa/linked-list/0025-reverse-nodes-in-k-group.org | 2 +- .../dsa/linked-list/0138-copy-list-with-random-pointer.org | 2 +- org/study_deck_02/dsa/linked-list/0141-linked-list-cycle.org | 2 +- org/study_deck_02/dsa/linked-list/0143-reorder-list.org | 2 +- org/study_deck_02/dsa/linked-list/0146-lru-cache.org | 2 +- .../dsa/linked-list/0206-reverse-linked-list.org | 2 +- .../dsa/linked-list/0287-find-the-duplicate-number.org | 2 +- .../dsa/linked-list/0725-split-linked-list-in-parts.org | 2 +- .../dsa/linked-list/1472-design-browser-history.org | 2 +- .../dsa/linked-list/1721-swapping-nodes-in-a-linked-list.org | 2 +- .../dsa/linked-list/2487-remove-nodes-from-linked-list.org | 2 +- .../dsa/math-geometry/0009-palindrome-number.org | 2 +- org/study_deck_02/dsa/math-geometry/0012-integer-to-roman.org | 2 +- org/study_deck_02/dsa/math-geometry/0043-multiply-strings.org | 2 +- org/study_deck_02/dsa/math-geometry/0048-rotate-image.org | 2 +- org/study_deck_02/dsa/math-geometry/0050-pow-x-n.org | 2 +- org/study_deck_02/dsa/math-geometry/0054-spiral-matrix.org | 2 +- org/study_deck_02/dsa/math-geometry/0066-plus-one.org | 2 +- .../dsa/math-geometry/0073-set-matrix-zeroes.org | 2 +- org/study_deck_02/dsa/math-geometry/0202-happy-number.org | 2 +- .../dsa/math-geometry/0296-best-meeting-point.org | 2 +- .../dsa/math-geometry/0840-magic-squares-in-grid.org | 2 +- .../1780-check-if-number-is-a-sum-of-powers-of-three.org | 2 +- org/study_deck_02/dsa/math-geometry/2013-detect-squares.org | 2 +- org/study_deck_02/dsa/math-geometry/2326-spiral-matrix-iv.org | 2 +- .../2698-find-the-punishment-number-of-an-integer.org | 2 +- .../0003-longest-substring-without-repeating-characters.org | 2 +- .../dsa/sliding-window/0076-minimum-window-substring.org | 2 +- .../sliding-window/0121-best-time-to-buy-and-sell-stock.org | 2 +- .../dsa/sliding-window/0239-sliding-window-maximum.org | 2 +- .../0424-longest-repeating-character-replacement.org | 2 +- .../dsa/sliding-window/0567-permutation-in-string.org | 2 +- ...-substrings-containing-every-vowel-and-k-consonants-ii.org | 2 +- org/study_deck_02/dsa/stack/0020-valid-parentheses.org | 2 +- .../dsa/stack/0084-largest-rectangle-in-histogram.org | 2 +- .../dsa/stack/0150-evaluate-reverse-polish-notation.org | 2 +- org/study_deck_02/dsa/stack/0155-min-stack.org | 2 +- org/study_deck_02/dsa/stack/0682-baseball-game.org | 2 +- org/study_deck_02/dsa/stack/0726-number-of-atoms.org | 2 +- org/study_deck_02/dsa/stack/0739-daily-temperatures.org | 2 +- org/study_deck_02/dsa/stack/0853-car-fleet.org | 2 +- org/study_deck_02/dsa/stack/0901-online-stock-span.org | 2 +- org/study_deck_02/dsa/stack/1544-make-the-string-great.org | 2 +- .../dsa/trees/0098-validate-binary-search-tree.org | 2 +- org/study_deck_02/dsa/trees/0100-same-tree.org | 2 +- .../dsa/trees/0102-binary-tree-level-order-traversal.org | 2 +- .../dsa/trees/0104-maximum-depth-of-binary-tree.org | 2 +- ...struct-binary-tree-from-preorder-and-inorder-traversal.org | 2 +- org/study_deck_02/dsa/trees/0110-balanced-binary-tree.org | 2 +- .../dsa/trees/0124-binary-tree-maximum-path-sum.org | 2 +- .../dsa/trees/0199-binary-tree-right-side-view.org | 2 +- org/study_deck_02/dsa/trees/0226-invert-binary-tree.org | 2 +- .../dsa/trees/0230-kth-smallest-element-in-a-bst.org | 2 +- .../0235-lowest-common-ancestor-of-a-binary-search-tree.org | 2 +- .../dsa/trees/0297-serialize-and-deserialize-binary-tree.org | 2 +- org/study_deck_02/dsa/trees/0543-diameter-of-binary-tree.org | 2 +- org/study_deck_02/dsa/trees/0572-subtree-of-another-tree.org | 2 +- .../dsa/trees/0590-n-ary-tree-postorder-traversal.org | 2 +- .../dsa/trees/1028-recover-a-tree-from-preorder-traversal.org | 2 +- .../dsa/trees/1376-time-needed-to-inform-all-employees.org | 2 +- .../dsa/trees/1448-count-good-nodes-in-binary-tree.org | 2 +- .../dsa/tries/0208-implement-trie-prefix-tree.org | 2 +- .../tries/0211-design-add-and-search-words-data-structure.org | 2 +- org/study_deck_02/dsa/tries/0212-word-search-ii.org | 2 +- org/study_deck_02/dsa/tries/1166-design-file-system.org | 2 +- .../dsa/two-pointers/0011-container-with-most-water.org | 2 +- org/study_deck_02/dsa/two-pointers/0015-3sum.org | 2 +- .../dsa/two-pointers/0042-trapping-rain-water.org | 2 +- org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org | 2 +- .../two-pointers/0167-two-sum-ii-input-array-is-sorted.org | 2 +- org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org | 2 +- org/study_deck_02/dsa/two-pointers/0344-reverse-string.org | 2 +- 200 files changed, 201 insertions(+), 201 deletions(-) diff --git a/leetcode/scaffold-notes.mjs b/leetcode/scaffold-notes.mjs index ec546ae..5c1fde7 100644 --- a/leetcode/scaffold-notes.mjs +++ b/leetcode/scaffold-notes.mjs @@ -38,8 +38,8 @@ for (const line of roadmap.split("\n")) { if (existsSync(filePath)) continue; const relPath = `../../roadmap.org::*${num}. ${name}`; - const content = `* TODO ${num}. ${name} :${diff}: -#+PROPERTY: STUDY_DECK_02 + const content = `#+PROPERTY: STUDY_DECK_02 +* TODO ${num}. ${name} :${diff}: :PROPERTIES: :NEETCODE: [[file:${relPath}][Roadmap]] :END: 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 3ffa21e..3292e95 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,5 +1,5 @@ -* TODO 0005. Longest Palindromic Substring :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0005. Longest Palindromic Substring :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]] :END: 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 076de4d..1d1917e 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,5 +1,5 @@ -* TODO 0070. Climbing Stairs :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0070. Climbing Stairs :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0070. Climbing Stairs][Roadmap]] :END: 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 fd31acc..2dda1f0 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,5 +1,5 @@ -* TODO 0091. Decode Ways :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0091. Decode Ways :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0091. Decode Ways][Roadmap]] :END: 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 a96c328..786f4dc 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,5 +1,5 @@ -* TODO 0139. Word Break :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0139. Word Break :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0139. Word Break][Roadmap]] :END: 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 f75d182..9d3128d 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,5 +1,5 @@ -* TODO 0152. Maximum Product Subarray :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0152. Maximum Product Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]] :END: 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 3310dc4..f11c256 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,5 +1,5 @@ -* TODO 0198. House Robber :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0198. House Robber :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0198. House Robber][Roadmap]] :END: 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 4f5b59c..bfc03f3 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,5 +1,5 @@ -* TODO 0213. House Robber II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0213. House Robber II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0213. House Robber II][Roadmap]] :END: 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 0f5e785..504e3cf 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,5 +1,5 @@ -* TODO 0300. Longest Increasing Subsequence :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0300. Longest Increasing Subsequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]] :END: 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 4baacab..ebac9e1 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,5 +1,5 @@ -* TODO 0322. Coin Change :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0322. Coin Change :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0322. Coin Change][Roadmap]] :END: 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 db62202..4ee1c83 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,5 +1,5 @@ -* TODO 0416. Partition Equal Subset Sum :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0416. Partition Equal Subset Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]] :END: 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 340de55..9b0f229 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,5 +1,5 @@ -* TODO 0647. Palindromic Substrings :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0647. Palindromic Substrings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0647. Palindromic Substrings][Roadmap]] :END: 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 28cf800..5b57ecb 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,5 +1,5 @@ -* TODO 0656. Coin Path :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0656. Coin Path :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0656. Coin Path][Roadmap]] :END: 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 e6258ed..0f6b23a 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,5 +1,5 @@ -* TODO 0746. Min Cost Climbing Stairs :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0746. Min Cost Climbing Stairs :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]] :END: 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 465fd31..68ad122 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,5 +1,5 @@ -* TODO 0010. Regular Expression Matching :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0010. Regular Expression Matching :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0010. Regular Expression Matching][Roadmap]] :END: 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 837dab8..f6a79d2 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,5 +1,5 @@ -* TODO 0062. Unique Paths :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0062. Unique Paths :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0062. Unique Paths][Roadmap]] :END: 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 ee1deb3..513584a 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,5 +1,5 @@ -* TODO 0072. Edit Distance :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0072. Edit Distance :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][Roadmap]] :END: 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 4eed1dc..a64efb6 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,5 +1,5 @@ -* TODO 0097. Interleaving String :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0097. Interleaving String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0097. Interleaving String][Roadmap]] :END: 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 f5e1a94..a4b4149 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,5 +1,5 @@ -* TODO 0115. Distinct Subsequences :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0115. Distinct Subsequences :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0115. Distinct Subsequences][Roadmap]] :END: 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 f512888..a1b8b0b 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,5 +1,5 @@ -* TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]] :END: 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 2bfa6d9..1b3b77b 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,5 +1,5 @@ -* TODO 0312. Burst Balloons :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0312. Burst Balloons :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0312. Burst Balloons][Roadmap]] :END: 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 1bb8b61..cd54223 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,5 +1,5 @@ -* TODO 0329. Longest Increasing Path In a Matrix :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0329. Longest Increasing Path In a Matrix :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]] :END: 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 c58092b..6ea8493 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,5 +1,5 @@ -* TODO 0494. Target Sum :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0494. Target Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0494. Target Sum][Roadmap]] :END: 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 fba1a17..a1590ac 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,5 +1,5 @@ -* TODO 0518. Coin Change II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0518. Coin Change II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0518. Coin Change II][Roadmap]] :END: 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 e756248..eb795cd 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,5 +1,5 @@ -* TODO 1143. Longest Common Subsequence :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1143. Longest Common Subsequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]] :END: 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 23f3c94..09c784e 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,5 +1,5 @@ -* TODO 1220. Count Vowels Permutation :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 1220. Count Vowels Permutation :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]] :END: 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 08ff2ea..0336926 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,5 +1,5 @@ -* TODO 1911. Maximum Alternating Subsequence Sum :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1911. Maximum Alternating Subsequence Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]] :END: 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 4949996..12a0376 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,5 +1,5 @@ -* TODO 0269. Alien Dictionary :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0269. Alien Dictionary :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0269. Alien Dictionary][Roadmap]] :END: 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 3c4dd70..e0b8aa1 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,5 +1,5 @@ -* TODO 0332. Reconstruct Itinerary :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0332. Reconstruct Itinerary :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]] :END: 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 c6583d4..0d0ed90 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,5 +1,5 @@ -* TODO 0743. Network Delay Time :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0743. Network Delay Time :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0743. Network Delay Time][Roadmap]] :END: 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 9a691df..70911e6 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,5 +1,5 @@ -* TODO 0778. Swim In Rising Water :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0778. Swim In Rising Water :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0778. Swim In Rising Water][Roadmap]] :END: 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 51c52b8..14ac418 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,5 +1,5 @@ -* TODO 0787. Cheapest Flights Within K Stops :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0787. Cheapest Flights Within K Stops :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]] :END: 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 6282a9c..febe742 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,5 +1,5 @@ -* TODO 1584. Min Cost to Connect All Points :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1584. Min Cost to Connect All Points :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]] :END: 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 96385e1..ac9bdca 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,5 +1,5 @@ -* TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]] :END: 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 9b759b6..bd682d3 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,5 +1,5 @@ -* TODO 2812. Find the Safest Path in a Grid :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2812. Find the Safest Path in a Grid :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]] :END: 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 43f32d5..d42d185 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,5 +1,5 @@ -* TODO 0001. Two Sum :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0001. Two Sum :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0001. Two Sum][Roadmap]] :END: 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 80916aa..8efda1a 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,5 +1,5 @@ -* TODO 0036. Valid Sudoku :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0036. Valid Sudoku :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0036. Valid Sudoku][Roadmap]] :END: 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 9eeb1dc..ad3c24d 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,5 +1,5 @@ -* TODO 0049. Group Anagrams :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0049. Group Anagrams :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0049. Group Anagrams][Roadmap]] :END: 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 b0b44a8..968a05b 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,5 +1,5 @@ -* TODO 0128. Longest Consecutive Sequence :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0128. Longest Consecutive Sequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]] :END: 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 d4001e4..b33cea0 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,5 +1,5 @@ -* TODO 0217. Contains Duplicate :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0217. Contains Duplicate :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][Roadmap]] :END: 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 1f988ec..d0eca5a 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,5 +1,5 @@ -* TODO 0238. Product of Array Except Self :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0238. Product of Array Except Self :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0238. Product of Array Except Self][Roadmap]] :END: 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 a322f49..dc1d9bb 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,5 +1,5 @@ -* TODO 0242. Valid Anagram :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0242. Valid Anagram :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0242. Valid Anagram][Roadmap]] :END: 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 f4755da..eb2ca70 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,5 +1,5 @@ -* TODO 0271. Encode and Decode Strings :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0271. Encode and Decode Strings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]] :END: 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 e89171e..e074396 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,5 +1,5 @@ -* TODO 0347. Top K Frequent Elements :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0347. Top K Frequent Elements :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]] :END: 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 bfaa77c..1ba3077 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,5 +1,5 @@ -* TODO 1408. String Matching in an Array :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 1408. String Matching in an Array :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1408. String Matching in an Array][Roadmap]] :END: 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 840d928..452c2c2 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,5 +1,5 @@ -* TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]] :END: 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 6308aa6..94ccddc 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,5 +1,5 @@ -* TODO 2678. Number of Senior Citizens :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 2678. Number of Senior Citizens :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]] :END: 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 ab7f3e3..c3993c1 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,5 +1,5 @@ -* TODO 0017. Letter Combinations of a Phone Number :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0017. Letter Combinations of a Phone Number :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]] :END: 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 e1ec08b..6549cd2 100644 --- a/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org +++ b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org @@ -1,5 +1,5 @@ -* TODO 0022. Generate Parentheses :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0022. Generate Parentheses :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0022. Generate Parentheses][Roadmap]] :END: 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 516393d..2fdab01 100644 --- a/org/study_deck_02/dsa/backtracking/0039-combination-sum.org +++ b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org @@ -1,5 +1,5 @@ -* TODO 0039. Combination Sum :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0039. Combination Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0039. Combination Sum][Roadmap]] :END: 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 319637e..18dd4c1 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,5 +1,5 @@ -* TODO 0040. Combination Sum II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0040. Combination Sum II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0040. Combination Sum II][Roadmap]] :END: diff --git a/org/study_deck_02/dsa/backtracking/0046-permutations.org b/org/study_deck_02/dsa/backtracking/0046-permutations.org index 119f5fb..8eb09dc 100644 --- a/org/study_deck_02/dsa/backtracking/0046-permutations.org +++ b/org/study_deck_02/dsa/backtracking/0046-permutations.org @@ -1,5 +1,5 @@ -* TODO 0046. Permutations :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0046. Permutations :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0046. Permutations][Roadmap]] :END: 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 dc48568..dc02d78 100644 --- a/org/study_deck_02/dsa/backtracking/0051-n-queens.org +++ b/org/study_deck_02/dsa/backtracking/0051-n-queens.org @@ -1,5 +1,5 @@ -* TODO 0051. N Queens :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0051. N Queens :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0051. N Queens][Roadmap]] :END: 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 8f31e8a..6ad4f80 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,5 +1,5 @@ -* TODO 0052. N Queens II :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0052. N Queens II :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0052. N Queens II][Roadmap]] :END: diff --git a/org/study_deck_02/dsa/backtracking/0077-combinations.org b/org/study_deck_02/dsa/backtracking/0077-combinations.org index eec49d1..e40d067 100644 --- a/org/study_deck_02/dsa/backtracking/0077-combinations.org +++ b/org/study_deck_02/dsa/backtracking/0077-combinations.org @@ -1,5 +1,5 @@ -* TODO 0077. Combinations :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0077. Combinations :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0077. Combinations][Roadmap]] :END: diff --git a/org/study_deck_02/dsa/backtracking/0078-subsets.org b/org/study_deck_02/dsa/backtracking/0078-subsets.org index 9e9f8dd..3ad8352 100644 --- a/org/study_deck_02/dsa/backtracking/0078-subsets.org +++ b/org/study_deck_02/dsa/backtracking/0078-subsets.org @@ -1,5 +1,5 @@ -* TODO 0078. Subsets :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0078. Subsets :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0078. Subsets][Roadmap]] :END: 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 5af618b..4d23bcf 100644 --- a/org/study_deck_02/dsa/backtracking/0079-word-search.org +++ b/org/study_deck_02/dsa/backtracking/0079-word-search.org @@ -1,5 +1,5 @@ -* TODO 0079. Word Search :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0079. Word Search :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0079. Word Search][Roadmap]] :END: 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 acfee46..8e9a239 100644 --- a/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org +++ b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org @@ -1,5 +1,5 @@ -* TODO 0090. Subsets II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0090. Subsets II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0090. Subsets II][Roadmap]] :END: 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 ae9e72b..5f63334 100644 --- a/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org +++ b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org @@ -1,5 +1,5 @@ -* TODO 0131. Palindrome Partitioning :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0131. Palindrome Partitioning :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]] :END: 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 77870ff..16d0dab 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,5 +1,5 @@ -* TODO 0351. Android Unlock Patterns :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0351. Android Unlock Patterns :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]] :END: 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 0271ddf..02fad78 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,5 +1,5 @@ -* TODO 1079. Letter Tile Possibilities :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1079. Letter Tile Possibilities :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]] :END: 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 e65f307..6b15743 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,5 +1,5 @@ -* TODO 1863. Sum of All Subsets XOR Total :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 1863. Sum of All Subsets XOR Total :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]] :END: 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 aa78366..3fba694 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,5 +1,5 @@ -* TODO 0004. Median of Two Sorted Arrays :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0004. Median of Two Sorted Arrays :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]] :END: 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 1f924c8..2bf3607 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,5 +1,5 @@ -* TODO 0033. Search In Rotated Sorted Array :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0033. Search In Rotated Sorted Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]] :END: 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 7de04d7..10906b1 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,5 +1,5 @@ -* TODO 0074. Search a 2D Matrix :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0074. Search a 2D Matrix :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]] :END: 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 49c0d98..17b3606 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,5 +1,5 @@ -* TODO 0153. Find Minimum In Rotated Sorted Array :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0153. Find Minimum In Rotated Sorted Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]] :END: 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 524ee1e..3cf60a1 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,5 +1,5 @@ -* TODO 0704. Binary Search :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0704. Binary Search :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0704. Binary Search][Roadmap]] :END: 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 ecfd2f4..49e7424 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,5 +1,5 @@ -* TODO 0719. Find K-th Smallest Pair Distance :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0719. Find K-th Smallest Pair Distance :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]] :END: 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 6933ef6..e635565 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,5 +1,5 @@ -* TODO 0875. Koko Eating Bananas :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0875. Koko Eating Bananas :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]] :END: 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 9dbf3b7..f5da752 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,5 +1,5 @@ -* TODO 0981. Time Based Key Value Store :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0981. Time Based Key Value Store :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]] :END: 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 aa5ae73..b592896 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,5 +1,5 @@ -* TODO 2300. Successful Pairs of Spells and Potions :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2300. Successful Pairs of Spells and Potions :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]] :END: 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 99f3344..8738725 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,5 +1,5 @@ -* TODO 0007. Reverse Integer :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0007. Reverse Integer :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0007. Reverse Integer][Roadmap]] :END: 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 8d835de..564e493 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,5 +1,5 @@ -* TODO 0136. Single Number :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0136. Single Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0136. Single Number][Roadmap]] :END: 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 3fda9a0..d822219 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,5 +1,5 @@ -* TODO 0190. Reverse Bits :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0190. Reverse Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0190. Reverse Bits][Roadmap]] :END: 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 6a32e99..beef005 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,5 +1,5 @@ -* TODO 0191. Number of 1 Bits :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0191. Number of 1 Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0191. Number of 1 Bits][Roadmap]] :END: 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 3c66b2a..72deb1e 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,5 +1,5 @@ -* TODO 0231. Power of Two :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0231. Power of Two :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0231. Power of Two][Roadmap]] :END: 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 2ea81e9..7dd49fe 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,5 +1,5 @@ -* TODO 0260. Single Number III :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0260. Single Number III :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0260. Single Number III][Roadmap]] :END: 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 701ee32..2b38a96 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,5 +1,5 @@ -* TODO 0268. Missing Number :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0268. Missing Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0268. Missing Number][Roadmap]] :END: 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 61311b3..ab18be9 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,5 +1,5 @@ -* TODO 0338. Counting Bits :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0338. Counting Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0338. Counting Bits][Roadmap]] :END: 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 57d9193..a4ce843 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,5 +1,5 @@ -* TODO 0371. Sum of Two Integers :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0371. Sum of Two Integers :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0371. Sum of Two Integers][Roadmap]] :END: 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 e535b5e..3ebdffe 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,5 +1,5 @@ -* TODO 2220. Minimum Bit Flips to Convert Number :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 2220. Minimum Bit Flips to Convert Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]] :END: 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 f504149..0b6ffbf 100644 --- a/org/study_deck_02/dsa/graphs/0127-word-ladder.org +++ b/org/study_deck_02/dsa/graphs/0127-word-ladder.org @@ -1,5 +1,5 @@ -* TODO 0127. Word Ladder :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0127. Word Ladder :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0127. Word Ladder][Roadmap]] :END: 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 85ff906..ce77530 100644 --- a/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org +++ b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org @@ -1,5 +1,5 @@ -* TODO 0130. Surrounded Regions :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0130. Surrounded Regions :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0130. Surrounded Regions][Roadmap]] :END: 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 790072f..9f577e7 100644 --- a/org/study_deck_02/dsa/graphs/0133-clone-graph.org +++ b/org/study_deck_02/dsa/graphs/0133-clone-graph.org @@ -1,5 +1,5 @@ -* TODO 0133. Clone Graph :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0133. Clone Graph :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0133. Clone Graph][Roadmap]] :END: 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 96b01a9..14aaa1e 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,5 +1,5 @@ -* TODO 0200. Number of Islands :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0200. Number of Islands :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0200. Number of Islands][Roadmap]] :END: 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 09f2574..9356d3e 100644 --- a/org/study_deck_02/dsa/graphs/0207-course-schedule.org +++ b/org/study_deck_02/dsa/graphs/0207-course-schedule.org @@ -1,5 +1,5 @@ -* TODO 0207. Course Schedule :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0207. Course Schedule :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0207. Course Schedule][Roadmap]] :END: 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 56db44f..c495595 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,5 +1,5 @@ -* TODO 0210. Course Schedule II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0210. Course Schedule II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0210. Course Schedule II][Roadmap]] :END: 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 d34115c..e1da8cd 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,5 +1,5 @@ -* TODO 0261. Graph Valid Tree :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0261. Graph Valid Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0261. Graph Valid Tree][Roadmap]] :END: 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 3b5beca..8811740 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,5 +1,5 @@ -* TODO 0286. Walls And Gates :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0286. Walls And Gates :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0286. Walls And Gates][Roadmap]] :END: 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 b665b79..0d92703 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,5 +1,5 @@ -* TODO 0323. Number of Connected Components In An Undirected Graph :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0323. Number of Connected Components In An Undirected Graph :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]] :END: 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 a5857dc..7528e17 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,5 +1,5 @@ -* TODO 0417. Pacific Atlantic Water Flow :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0417. Pacific Atlantic Water Flow :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]] :END: 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 2a7376b..b6f8d35 100644 --- a/org/study_deck_02/dsa/graphs/0684-redundant-connection.org +++ b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org @@ -1,5 +1,5 @@ -* TODO 0684. Redundant Connection :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0684. Redundant Connection :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0684. Redundant Connection][Roadmap]] :END: 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 86b1570..8916ee4 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,5 +1,5 @@ -* TODO 0695. Max Area of Island :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0695. Max Area of Island :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0695. Max Area of Island][Roadmap]] :END: 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 c551bf3..88efb0a 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,5 +1,5 @@ -* TODO 0802. Find Eventual Safe States :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0802. Find Eventual Safe States :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]] :END: 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 dd13ee7..0523fb4 100644 --- a/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org +++ b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org @@ -1,5 +1,5 @@ -* TODO 0994. Rotting Oranges :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0994. Rotting Oranges :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0994. Rotting Oranges][Roadmap]] :END: 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 5944b80..fa323cf 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,5 +1,5 @@ -* TODO 1905. Count Sub Islands :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1905. Count Sub Islands :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1905. Count Sub Islands][Roadmap]] :END: 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 47a0b85..b63db3f 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,5 +1,5 @@ -* TODO 2092. Find All People With Secret :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 2092. Find All People With Secret :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2092. Find All People With Secret][Roadmap]] :END: 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 e740c74..bebf82b 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,5 +1,5 @@ -* TODO 2658. Maximum Number of Fish in a Grid :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2658. Maximum Number of Fish in a Grid :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]] :END: 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 cfebf85..11c5565 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,5 +1,5 @@ -* TODO 2924. Find Champion II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2924. Find Champion II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2924. Find Champion II][Roadmap]] :END: 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 be1a991..57713ed 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,5 +1,5 @@ -* TODO 0045. Jump Game II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0045. Jump Game II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0045. Jump Game II][Roadmap]] :END: 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 5d19bf0..19e508e 100644 --- a/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org +++ b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org @@ -1,5 +1,5 @@ -* TODO 0053. Maximum Subarray :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0053. Maximum Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0053. Maximum Subarray][Roadmap]] :END: 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 16878ad..2181b9c 100644 --- a/org/study_deck_02/dsa/greedy/0055-jump-game.org +++ b/org/study_deck_02/dsa/greedy/0055-jump-game.org @@ -1,5 +1,5 @@ -* TODO 0055. Jump Game :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0055. Jump Game :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0055. Jump Game][Roadmap]] :END: 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 6fbfec4..d072480 100644 --- a/org/study_deck_02/dsa/greedy/0134-gas-station.org +++ b/org/study_deck_02/dsa/greedy/0134-gas-station.org @@ -1,5 +1,5 @@ -* TODO 0134. Gas Station :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0134. Gas Station :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0134. Gas Station][Roadmap]] :END: 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 f0b73dd..7ce6ad7 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,5 +1,5 @@ -* TODO 0678. Valid Parenthesis String :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0678. Valid Parenthesis String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0678. Valid Parenthesis String][Roadmap]] :END: 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 2c1110f..79eef0e 100644 --- a/org/study_deck_02/dsa/greedy/0763-partition-labels.org +++ b/org/study_deck_02/dsa/greedy/0763-partition-labels.org @@ -1,5 +1,5 @@ -* TODO 0763. Partition Labels :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0763. Partition Labels :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0763. Partition Labels][Roadmap]] :END: 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 a3952c6..cba8660 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,5 +1,5 @@ -* TODO 0846. Hand of Straights :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0846. Hand of Straights :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0846. Hand of Straights][Roadmap]] :END: 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 d6ddb7f..e946a50 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,5 +1,5 @@ -* TODO 0945. Minimum Increment to Make Array Unique :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0945. Minimum Increment to Make Array Unique :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0945. Minimum Increment to Make Array Unique][Roadmap]] :END: 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 afed4a4..3fd6c91 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,5 +1,5 @@ -* TODO 0978. Longest Turbulent Subarray :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0978. Longest Turbulent Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0978. Longest Turbulent Subarray][Roadmap]] :END: 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 f67f0a5..849cebb 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,5 +1,5 @@ -* TODO 1871. Jump Game VII :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1871. Jump Game VII :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1871. Jump Game VII][Roadmap]] :END: 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 e1f1077..f664e65 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,5 +1,5 @@ -* TODO 1899. Merge Triplets to Form Target Triplet :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1899. Merge Triplets to Form Target Triplet :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1899. Merge Triplets to Form Target Triplet][Roadmap]] :END: 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 b6c2354..8e306b5 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,5 +1,5 @@ -* TODO 0215. Kth Largest Element In An Array :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0215. Kth Largest Element In An Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0215. Kth Largest Element In An Array][Roadmap]] :END: 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 a415245..b21c48f 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,5 +1,5 @@ -* TODO 0295. Find Median From Data Stream :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0295. Find Median From Data Stream :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0295. Find Median From Data Stream][Roadmap]] :END: 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 3d6fc2b..98c8e9a 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,5 +1,5 @@ -* TODO 0355. Design Twitter :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0355. Design Twitter :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0355. Design Twitter][Roadmap]] :END: 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 6962625..39229a7 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,5 +1,5 @@ -* TODO 0621. Task Scheduler :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0621. Task Scheduler :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0621. Task Scheduler][Roadmap]] :END: 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 2741022..2ab1984 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,5 +1,5 @@ -* TODO 0703. Kth Largest Element In a Stream :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0703. Kth Largest Element In a Stream :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0703. Kth Largest Element In a Stream][Roadmap]] :END: 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 25d7e72..0971014 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,5 +1,5 @@ -* TODO 0973. K Closest Points to Origin :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0973. K Closest Points to Origin :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0973. K Closest Points to Origin][Roadmap]] :END: 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 e43ed31..165bc5d 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,5 +1,5 @@ -* TODO 1046. Last Stone Weight :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 1046. Last Stone Weight :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1046. Last Stone Weight][Roadmap]] :END: 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 f021470..033c54b 100644 --- a/org/study_deck_02/dsa/intervals/0056-merge-intervals.org +++ b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org @@ -1,5 +1,5 @@ -* TODO 0056. Merge Intervals :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0056. Merge Intervals :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0056. Merge Intervals][Roadmap]] :END: 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 9b20130..3d55959 100644 --- a/org/study_deck_02/dsa/intervals/0057-insert-interval.org +++ b/org/study_deck_02/dsa/intervals/0057-insert-interval.org @@ -1,5 +1,5 @@ -* TODO 0057. Insert Interval :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0057. Insert Interval :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0057. Insert Interval][Roadmap]] :END: 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 d27204e..9a320df 100644 --- a/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org +++ b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org @@ -1,5 +1,5 @@ -* TODO 0252. Meeting Rooms :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0252. Meeting Rooms :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0252. Meeting Rooms][Roadmap]] :END: 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 a371e14..c0de56c 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,5 +1,5 @@ -* TODO 0253. Meeting Rooms II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0253. Meeting Rooms II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0253. Meeting Rooms II][Roadmap]] :END: 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 e6239ea..955e45b 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,5 +1,5 @@ -* TODO 0435. Non Overlapping Intervals :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0435. Non Overlapping Intervals :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0435. Non Overlapping Intervals][Roadmap]] :END: 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 f6be592..8851f53 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,5 +1,5 @@ -* TODO 0986. Interval List Intersections :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0986. Interval List Intersections :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0986. Interval List Intersections][Roadmap]] :END: 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 4788a93..1bb7ec3 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,5 +1,5 @@ -* TODO 1851. Minimum Interval to Include Each Query :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 1851. Minimum Interval to Include Each Query :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1851. Minimum Interval to Include Each Query][Roadmap]] :END: 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 deee2ab..4bea470 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,5 +1,5 @@ -* TODO 0002. Add Two Numbers :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0002. Add Two Numbers :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0002. Add Two Numbers][Roadmap]] :END: 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 54dad34..3b79d14 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,5 +1,5 @@ -* TODO 0019. Remove Nth Node From End of List :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0019. Remove Nth Node From End of List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0019. Remove Nth Node From End of List][Roadmap]] :END: 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 d71de96..ed0868b 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,5 +1,5 @@ -* TODO 0021. Merge Two Sorted Lists :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0021. Merge Two Sorted Lists :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0021. Merge Two Sorted Lists][Roadmap]] :END: 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 b0ee04e..993939b 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,5 +1,5 @@ -* TODO 0023. Merge K Sorted Lists :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0023. Merge K Sorted Lists :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0023. Merge K Sorted Lists][Roadmap]] :END: 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 6350241..6fca712 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,5 +1,5 @@ -* TODO 0025. Reverse Nodes In K Group :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0025. Reverse Nodes In K Group :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0025. Reverse Nodes In K Group][Roadmap]] :END: 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 ae19bc8..1690707 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,5 +1,5 @@ -* TODO 0138. Copy List With Random Pointer :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0138. Copy List With Random Pointer :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0138. Copy List With Random Pointer][Roadmap]] :END: 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 9b12a3d..02dd047 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,5 +1,5 @@ -* TODO 0141. Linked List Cycle :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0141. Linked List Cycle :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0141. Linked List Cycle][Roadmap]] :END: 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 d6f634e..4771d42 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,5 +1,5 @@ -* TODO 0143. Reorder List :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0143. Reorder List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0143. Reorder List][Roadmap]] :END: 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 26c8501..0cd2b81 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,5 +1,5 @@ -* TODO 0146. LRU Cache :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0146. LRU Cache :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0146. LRU Cache][Roadmap]] :END: 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 54da64c..b9f7caa 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,5 +1,5 @@ -* TODO 0206. Reverse Linked List :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0206. Reverse Linked List :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0206. Reverse Linked List][Roadmap]] :END: 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 fb1e3c3..8f1ae99 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,5 +1,5 @@ -* TODO 0287. Find The Duplicate Number :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0287. Find The Duplicate Number :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0287. Find The Duplicate Number][Roadmap]] :END: 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 c2dd9d9..4adab14 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,5 +1,5 @@ -* TODO 0725. Split Linked List in Parts :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0725. Split Linked List in Parts :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0725. Split Linked List in Parts][Roadmap]] :END: 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 3b022d3..81e5618 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,5 +1,5 @@ -* TODO 1472. Design Browser History :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1472. Design Browser History :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1472. Design Browser History][Roadmap]] :END: 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 713f316..ad06ca4 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,5 +1,5 @@ -* TODO 1721. Swapping Nodes in a Linked List :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1721. Swapping Nodes in a Linked List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1721. Swapping Nodes in a Linked List][Roadmap]] :END: 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 2931c17..317d845 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,5 +1,5 @@ -* TODO 2487. Remove Nodes From Linked List :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2487. Remove Nodes From Linked List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2487. Remove Nodes From Linked List][Roadmap]] :END: 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 1366bfa..ca4447c 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,5 +1,5 @@ -* TODO 0009. Palindrome Number :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0009. Palindrome Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0009. Palindrome Number][Roadmap]] :END: 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 2e525b5..7e188b9 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,5 +1,5 @@ -* TODO 0012. Integer to Roman :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0012. Integer to Roman :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0012. Integer to Roman][Roadmap]] :END: 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 0836a1a..efd5275 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,5 +1,5 @@ -* TODO 0043. Multiply Strings :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0043. Multiply Strings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0043. Multiply Strings][Roadmap]] :END: 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 6c5ae98..f7d4086 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,5 +1,5 @@ -* TODO 0048. Rotate Image :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0048. Rotate Image :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0048. Rotate Image][Roadmap]] :END: 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 0cad04d..3e383a2 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,5 +1,5 @@ -* TODO 0050. Pow(x, n) :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0050. Pow(x, n) :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0050. Pow(x, n)][Roadmap]] :END: 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 22d02eb..c8446a3 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,5 +1,5 @@ -* TODO 0054. Spiral Matrix :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0054. Spiral Matrix :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0054. Spiral Matrix][Roadmap]] :END: 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 cbfcf35..051b8cc 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,5 +1,5 @@ -* TODO 0066. Plus One :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0066. Plus One :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0066. Plus One][Roadmap]] :END: 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 9f84f65..0547447 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,5 +1,5 @@ -* TODO 0073. Set Matrix Zeroes :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0073. Set Matrix Zeroes :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0073. Set Matrix Zeroes][Roadmap]] :END: 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 8c7906e..a1f3dd9 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,5 +1,5 @@ -* TODO 0202. Happy Number :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0202. Happy Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0202. Happy Number][Roadmap]] :END: 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 51607cc..3e59258 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,5 +1,5 @@ -* TODO 0296. Best Meeting Point :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0296. Best Meeting Point :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0296. Best Meeting Point][Roadmap]] :END: 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 9835ec0..516b2fd 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,5 +1,5 @@ -* TODO 0840. Magic Squares In Grid :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0840. Magic Squares In Grid :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0840. Magic Squares In Grid][Roadmap]] :END: 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 643316c..3cbdc86 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,5 +1,5 @@ -* TODO 1780. Check if Number is a Sum of Powers of Three :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1780. Check if Number is a Sum of Powers of Three :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1780. Check if Number is a Sum of Powers of Three][Roadmap]] :END: 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 ad77e70..3a6554b 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,5 +1,5 @@ -* TODO 2013. Detect Squares :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2013. Detect Squares :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2013. Detect Squares][Roadmap]] :END: 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 49d0b44..ac0314a 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,5 +1,5 @@ -* TODO 2326. Spiral Matrix IV :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2326. Spiral Matrix IV :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2326. Spiral Matrix IV][Roadmap]] :END: 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 10a624d..c72e5b5 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,5 +1,5 @@ -* TODO 2698. Find the Punishment Number of an Integer :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 2698. Find the Punishment Number of an Integer :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2698. Find the Punishment Number of an Integer][Roadmap]] :END: 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 0003ea8..3a96441 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,5 +1,5 @@ -* TODO 0003. Longest Substring Without Repeating Characters :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0003. Longest Substring Without Repeating Characters :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0003. Longest Substring Without Repeating Characters][Roadmap]] :END: 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 9c4b64c..50824cd 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,5 +1,5 @@ -* TODO 0076. Minimum Window Substring :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0076. Minimum Window Substring :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0076. Minimum Window Substring][Roadmap]] :END: 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 f42fabc..8fd3d48 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,5 +1,5 @@ -* TODO 0121. Best Time to Buy And Sell Stock :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0121. Best Time to Buy And Sell Stock :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0121. Best Time to Buy And Sell Stock][Roadmap]] :END: 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 4e88e9a..99b9d73 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,5 +1,5 @@ -* TODO 0239. Sliding Window Maximum :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0239. Sliding Window Maximum :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0239. Sliding Window Maximum][Roadmap]] :END: 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 7d2bb96..2ec9a70 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,5 +1,5 @@ -* TODO 0424. Longest Repeating Character Replacement :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0424. Longest Repeating Character Replacement :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0424. Longest Repeating Character Replacement][Roadmap]] :END: 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 f25d668..951eb39 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,5 +1,5 @@ -* TODO 0567. Permutation In String :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0567. Permutation In String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0567. Permutation In String][Roadmap]] :END: 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 d389c67..b5e768e 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,5 +1,5 @@ -* TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 3306. Count of Substrings Containing Every Vowel and K Consonants II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*3306. Count of Substrings Containing Every Vowel and K Consonants II][Roadmap]] :END: 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 efa2c56..d61c6f1 100644 --- a/org/study_deck_02/dsa/stack/0020-valid-parentheses.org +++ b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org @@ -1,5 +1,5 @@ -* TODO 0020. Valid Parentheses :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0020. Valid Parentheses :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0020. Valid Parentheses][Roadmap]] :END: 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 d93f018..3dc0d6d 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,5 +1,5 @@ -* TODO 0084. Largest Rectangle In Histogram :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0084. Largest Rectangle In Histogram :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0084. Largest Rectangle In Histogram][Roadmap]] :END: 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 1f7855b..e769faf 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,5 +1,5 @@ -* TODO 0150. Evaluate Reverse Polish Notation :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0150. Evaluate Reverse Polish Notation :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0150. Evaluate Reverse Polish Notation][Roadmap]] :END: 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 58fa4e8..d20b916 100644 --- a/org/study_deck_02/dsa/stack/0155-min-stack.org +++ b/org/study_deck_02/dsa/stack/0155-min-stack.org @@ -1,5 +1,5 @@ -* TODO 0155. Min Stack :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0155. Min Stack :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0155. Min Stack][Roadmap]] :END: 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 1d005b9..09769cb 100644 --- a/org/study_deck_02/dsa/stack/0682-baseball-game.org +++ b/org/study_deck_02/dsa/stack/0682-baseball-game.org @@ -1,5 +1,5 @@ -* TODO 0682. Baseball Game :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0682. Baseball Game :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0682. Baseball Game][Roadmap]] :END: 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 a80b89d..199c505 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,5 +1,5 @@ -* TODO 0726. Number of Atoms :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0726. Number of Atoms :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0726. Number of Atoms][Roadmap]] :END: 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 3ae0b29..0b897c6 100644 --- a/org/study_deck_02/dsa/stack/0739-daily-temperatures.org +++ b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org @@ -1,5 +1,5 @@ -* TODO 0739. Daily Temperatures :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0739. Daily Temperatures :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0739. Daily Temperatures][Roadmap]] :END: 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 c92633f..0fae44e 100644 --- a/org/study_deck_02/dsa/stack/0853-car-fleet.org +++ b/org/study_deck_02/dsa/stack/0853-car-fleet.org @@ -1,5 +1,5 @@ -* TODO 0853. Car Fleet :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0853. Car Fleet :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0853. Car Fleet][Roadmap]] :END: 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 98b9569..7ad3503 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,5 +1,5 @@ -* TODO 0901. Online Stock Span :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0901. Online Stock Span :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0901. Online Stock Span][Roadmap]] :END: 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 3928b1d..4453d2c 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,5 +1,5 @@ -* TODO 1544. Make The String Great :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 1544. Make The String Great :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1544. Make The String Great][Roadmap]] :END: 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 c87f9a0..6bfd876 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,5 +1,5 @@ -* TODO 0098. Validate Binary Search Tree :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0098. Validate Binary Search Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0098. Validate Binary Search Tree][Roadmap]] :END: 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 ab129f9..177d958 100644 --- a/org/study_deck_02/dsa/trees/0100-same-tree.org +++ b/org/study_deck_02/dsa/trees/0100-same-tree.org @@ -1,5 +1,5 @@ -* TODO 0100. Same Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0100. Same Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0100. Same Tree][Roadmap]] :END: 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 7708d38..c561aa2 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,5 +1,5 @@ -* TODO 0102. Binary Tree Level Order Traversal :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0102. Binary Tree Level Order Traversal :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]] :END: 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 c11d7cb..dc93f91 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,5 +1,5 @@ -* TODO 0104. Maximum Depth of Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0104. Maximum Depth of Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]] :END: 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 3615278..d7bc646 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,5 +1,5 @@ -* TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]] :END: 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 ccd2130..33684e1 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,5 +1,5 @@ -* TODO 0110. Balanced Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0110. Balanced Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0110. Balanced Binary Tree][Roadmap]] :END: 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 b949eea..cd03ab4 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,5 +1,5 @@ -* TODO 0124. Binary Tree Maximum Path Sum :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0124. Binary Tree Maximum Path Sum :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]] :END: 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 c4265e4..9808743 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,5 +1,5 @@ -* TODO 0199. Binary Tree Right Side View :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0199. Binary Tree Right Side View :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0199. Binary Tree Right Side View][Roadmap]] :END: 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 f935b36..98e745f 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,5 +1,5 @@ -* TODO 0226. Invert Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0226. Invert Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0226. Invert Binary Tree][Roadmap]] :END: 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 dbed89e..2b2b8db 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,5 +1,5 @@ -* TODO 0230. Kth Smallest Element In a Bst :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0230. Kth Smallest Element In a Bst :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]] :END: 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 999507d..176e0b4 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,5 +1,5 @@ -* TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]] :END: 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 db36d5e..4edd280 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,5 +1,5 @@ -* TODO 0297. Serialize And Deserialize Binary Tree :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0297. Serialize And Deserialize Binary Tree :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]] :END: 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 06aae80..2c84022 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,5 +1,5 @@ -* TODO 0543. Diameter of Binary Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0543. Diameter of Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0543. Diameter of Binary Tree][Roadmap]] :END: 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 d0a0ab2..533de1e 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,5 +1,5 @@ -* TODO 0572. Subtree of Another Tree :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0572. Subtree of Another Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0572. Subtree of Another Tree][Roadmap]] :END: 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 0034b41..9db02a5 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,5 +1,5 @@ -* TODO 0590. N-ary Tree Postorder Traversal :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0590. N-ary Tree Postorder Traversal :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]] :END: 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 6cd84d8..03bc116 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,5 +1,5 @@ -* TODO 1028. Recover a Tree From Preorder Traversal :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 1028. Recover a Tree From Preorder Traversal :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]] :END: 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 91fe56d..7ebbc46 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,5 +1,5 @@ -* TODO 1376. Time Needed to Inform All Employees :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1376. Time Needed to Inform All Employees :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]] :END: 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 faa7c71..e3d2cae 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,5 +1,5 @@ -* TODO 1448. Count Good Nodes In Binary Tree :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1448. Count Good Nodes In Binary Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]] :END: 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 a9d76cd..4c6b850 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,5 +1,5 @@ -* TODO 0208. Implement Trie Prefix Tree :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0208. Implement Trie Prefix Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0208. Implement Trie Prefix Tree][Roadmap]] :END: 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 c18ccb4..8de21b7 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,5 +1,5 @@ -* TODO 0211. Design Add And Search Words Data Structure :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0211. Design Add And Search Words Data Structure :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0211. Design Add And Search Words Data Structure][Roadmap]] :END: 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 8537e9f..0884fa2 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,5 +1,5 @@ -* TODO 0212. Word Search II :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0212. Word Search II :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0212. Word Search II][Roadmap]] :END: 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 7865bc7..c840eb3 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,5 +1,5 @@ -* TODO 1166. Design File System :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 1166. Design File System :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1166. Design File System][Roadmap]] :END: 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 d11c1c2..4f9c7c8 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,5 +1,5 @@ -* TODO 0011. Container With Most Water :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0011. Container With Most Water :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0011. Container With Most Water][Roadmap]] :END: 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 34e8bd3..396c342 100644 --- a/org/study_deck_02/dsa/two-pointers/0015-3sum.org +++ b/org/study_deck_02/dsa/two-pointers/0015-3sum.org @@ -1,5 +1,5 @@ -* TODO 0015. 3Sum :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0015. 3Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0015. 3Sum][Roadmap]] :END: 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 8c6b077..c2402ce 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,5 +1,5 @@ -* TODO 0042. Trapping Rain Water :hard: #+PROPERTY: STUDY_DECK_02 +* TODO 0042. Trapping Rain Water :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0042. Trapping Rain Water][Roadmap]] :END: 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 6b934d6..5bfe141 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,5 +1,5 @@ -* TODO 0125. Valid Palindrome :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0125. Valid Palindrome :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0125. Valid Palindrome][Roadmap]] :END: 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 7365df7..7f1dca8 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,5 +1,5 @@ -* TODO 0167. Two Sum II Input Array Is Sorted :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0167. Two Sum II Input Array Is Sorted :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0167. Two Sum II Input Array Is Sorted][Roadmap]] :END: 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 858f068..6613b2e 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,5 +1,5 @@ -* TODO 0259. 3Sum Smaller :medium: #+PROPERTY: STUDY_DECK_02 +* TODO 0259. 3Sum Smaller :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0259. 3Sum Smaller][Roadmap]] :END: 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 a3ac871..0b10141 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,5 +1,5 @@ -* TODO 0344. Reverse String :easy: #+PROPERTY: STUDY_DECK_02 +* TODO 0344. Reverse String :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0344. Reverse String][Roadmap]] :END: