From 0f9312eaee16fe18ce242b8959db097f6a1a4c23 Mon Sep 17 00:00:00 2001 From: Wong Ding Feng Date: Mon, 1 Jun 2026 18:12:40 +0800 Subject: [PATCH] upd --- AGENTS.md | 2 +- org/study_deck_02/AGENTS.md | 21 +++- .../0005-longest-palindromic-substring.org | 2 +- .../0070-climbing-stairs.org | 2 +- .../0091-decode-ways.org | 2 +- .../0139-word-break.org | 2 +- .../0152-maximum-product-subarray.org | 2 +- .../0198-house-robber.org | 2 +- .../0213-house-robber-ii.org | 2 +- .../0300-longest-increasing-subsequence.org | 2 +- .../0322-coin-change.org | 2 +- .../0416-partition-equal-subset-sum.org | 2 +- .../0647-palindromic-substrings.org | 2 +- .../0656-coin-path.org | 2 +- .../0746-min-cost-climbing-stairs.org | 2 +- .../0010-regular-expression-matching.org | 2 +- .../0062-unique-paths.org | 2 +- .../0072-edit-distance.org | 2 +- .../0097-interleaving-string.org | 2 +- .../0115-distinct-subsequences.org | 2 +- ...me-to-buy-and-sell-stock-with-cooldown.org | 2 +- .../0312-burst-balloons.org | 2 +- ...29-longest-increasing-path-in-a-matrix.org | 2 +- .../0494-target-sum.org | 2 +- .../0518-coin-change-ii.org | 2 +- .../1143-longest-common-subsequence.org | 2 +- .../1220-count-vowels-permutation.org | 2 +- ...11-maximum-alternating-subsequence-sum.org | 2 +- .../advanced-graphs/0269-alien-dictionary.org | 2 +- .../0332-reconstruct-itinerary.org | 2 +- .../0743-network-delay-time.org | 2 +- .../0778-swim-in-rising-water.org | 2 +- .../0787-cheapest-flights-within-k-stops.org | 2 +- .../1584-min-cost-to-connect-all-points.org | 2 +- ...odes-into-the-maximum-number-of-groups.org | 2 +- .../2812-find-the-safest-path-in-a-grid.org | 2 +- .../dsa/arrays-hashing/0001-two-sum.org | 2 +- .../dsa/arrays-hashing/0036-valid-sudoku.org | 2 +- .../arrays-hashing/0049-group-anagrams.org | 2 +- .../0128-longest-consecutive-sequence.org | 2 +- .../0217-contains-duplicate.org | 2 +- .../0238-product-of-array-except-self.org | 2 +- .../dsa/arrays-hashing/0242-valid-anagram.org | 29 +++-- .../0271-encode-and-decode-strings.org | 2 +- .../0347-top-k-frequent-elements.org | 2 +- .../1408-string-matching-in-an-array.org | 2 +- ...erations-to-move-all-balls-to-each-box.org | 2 +- .../2678-number-of-senior-citizens.org | 2 +- ...-letter-combinations-of-a-phone-number.org | 2 +- .../0022-generate-parentheses.org | 2 +- .../dsa/backtracking/0039-combination-sum.org | 2 +- .../backtracking/0040-combination-sum-ii.org | 2 +- .../dsa/backtracking/0046-permutations.org | 2 +- .../dsa/backtracking/0051-n-queens.org | 2 +- .../dsa/backtracking/0052-n-queens-ii.org | 2 +- .../dsa/backtracking/0077-combinations.org | 2 +- .../dsa/backtracking/0078-subsets.org | 2 +- .../dsa/backtracking/0079-word-search.org | 2 +- .../dsa/backtracking/0090-subsets-ii.org | 2 +- .../0131-palindrome-partitioning.org | 2 +- .../0351-android-unlock-patterns.org | 2 +- .../1079-letter-tile-possibilities.org | 2 +- .../1863-sum-of-all-subsets-xor-total.org | 2 +- .../0004-median-of-two-sorted-arrays.org | 2 +- .../0033-search-in-rotated-sorted-array.org | 2 +- .../binary-search/0074-search-a-2d-matrix.org | 2 +- ...3-find-minimum-in-rotated-sorted-array.org | 2 +- .../dsa/binary-search/0704-binary-search.org | 2 +- .../0719-find-k-th-smallest-pair-distance.org | 2 +- .../0875-koko-eating-bananas.org | 2 +- .../0981-time-based-key-value-store.org | 2 +- ...successful-pairs-of-spells-and-potions.org | 2 +- .../bit-manipulation/0007-reverse-integer.org | 2 +- .../bit-manipulation/0136-single-number.org | 2 +- .../bit-manipulation/0190-reverse-bits.org | 2 +- .../0191-number-of-1-bits.org | 2 +- .../bit-manipulation/0231-power-of-two.org | 2 +- .../0260-single-number-iii.org | 2 +- .../bit-manipulation/0268-missing-number.org | 2 +- .../bit-manipulation/0338-counting-bits.org | 2 +- .../0371-sum-of-two-integers.org | 2 +- ...20-minimum-bit-flips-to-convert-number.org | 2 +- .../dsa/graphs/0127-word-ladder.org | 2 +- .../dsa/graphs/0130-surrounded-regions.org | 2 +- .../dsa/graphs/0133-clone-graph.org | 2 +- .../dsa/graphs/0200-number-of-islands.org | 2 +- .../dsa/graphs/0207-course-schedule.org | 2 +- .../dsa/graphs/0210-course-schedule-ii.org | 2 +- .../dsa/graphs/0261-graph-valid-tree.org | 2 +- .../dsa/graphs/0286-walls-and-gates.org | 2 +- ...cted-components-in-an-undirected-graph.org | 2 +- .../0417-pacific-atlantic-water-flow.org | 2 +- .../dsa/graphs/0684-redundant-connection.org | 2 +- .../dsa/graphs/0695-max-area-of-island.org | 2 +- .../graphs/0802-find-eventual-safe-states.org | 2 +- .../dsa/graphs/0994-rotting-oranges.org | 2 +- .../dsa/graphs/1905-count-sub-islands.org | 2 +- .../2092-find-all-people-with-secret.org | 2 +- .../2658-maximum-number-of-fish-in-a-grid.org | 2 +- .../dsa/graphs/2924-find-champion-ii.org | 2 +- .../dsa/greedy/0045-jump-game-ii.org | 2 +- .../dsa/greedy/0053-maximum-subarray.org | 2 +- .../dsa/greedy/0055-jump-game.org | 2 +- .../dsa/greedy/0134-gas-station.org | 2 +- .../greedy/0678-valid-parenthesis-string.org | 2 +- .../dsa/greedy/0763-partition-labels.org | 2 +- .../dsa/greedy/0846-hand-of-straights.org | 2 +- ...minimum-increment-to-make-array-unique.org | 2 +- .../0978-longest-turbulent-subarray.org | 2 +- .../dsa/greedy/1871-jump-game-vii.org | 2 +- ...-merge-triplets-to-form-target-triplet.org | 2 +- .../0215-kth-largest-element-in-an-array.org | 2 +- .../0295-find-median-from-data-stream.org | 2 +- .../0355-design-twitter.org | 2 +- .../0621-task-scheduler.org | 2 +- .../0703-kth-largest-element-in-a-stream.org | 2 +- .../0973-k-closest-points-to-origin.org | 2 +- .../1046-last-stone-weight.org | 2 +- .../dsa/intervals/0056-merge-intervals.org | 2 +- .../dsa/intervals/0057-insert-interval.org | 2 +- .../dsa/intervals/0252-meeting-rooms.org | 2 +- .../dsa/intervals/0253-meeting-rooms-ii.org | 2 +- .../0435-non-overlapping-intervals.org | 2 +- .../0986-interval-list-intersections.org | 2 +- ...minimum-interval-to-include-each-query.org | 2 +- .../dsa/linked-list/0002-add-two-numbers.org | 2 +- .../0019-remove-nth-node-from-end-of-list.org | 2 +- .../0021-merge-two-sorted-lists.org | 2 +- .../linked-list/0023-merge-k-sorted-lists.org | 2 +- .../0025-reverse-nodes-in-k-group.org | 2 +- .../0138-copy-list-with-random-pointer.org | 2 +- .../linked-list/0141-linked-list-cycle.org | 2 +- .../dsa/linked-list/0143-reorder-list.org | 2 +- .../dsa/linked-list/0146-lru-cache.org | 2 +- .../linked-list/0206-reverse-linked-list.org | 2 +- .../0287-find-the-duplicate-number.org | 2 +- .../0725-split-linked-list-in-parts.org | 2 +- .../1472-design-browser-history.org | 2 +- .../1721-swapping-nodes-in-a-linked-list.org | 2 +- .../2487-remove-nodes-from-linked-list.org | 2 +- .../math-geometry/0009-palindrome-number.org | 2 +- .../math-geometry/0012-integer-to-roman.org | 2 +- .../math-geometry/0043-multiply-strings.org | 2 +- .../dsa/math-geometry/0048-rotate-image.org | 2 +- .../dsa/math-geometry/0050-pow-x-n.org | 2 +- .../dsa/math-geometry/0054-spiral-matrix.org | 2 +- .../dsa/math-geometry/0066-plus-one.org | 2 +- .../math-geometry/0073-set-matrix-zeroes.org | 2 +- .../dsa/math-geometry/0202-happy-number.org | 2 +- .../math-geometry/0296-best-meeting-point.org | 2 +- .../0840-magic-squares-in-grid.org | 2 +- ...-if-number-is-a-sum-of-powers-of-three.org | 2 +- .../dsa/math-geometry/2013-detect-squares.org | 2 +- .../math-geometry/2326-spiral-matrix-iv.org | 2 +- ...nd-the-punishment-number-of-an-integer.org | 2 +- ...substring-without-repeating-characters.org | 2 +- .../0076-minimum-window-substring.org | 2 +- .../0121-best-time-to-buy-and-sell-stock.org | 2 +- .../0239-sliding-window-maximum.org | 2 +- ...ongest-repeating-character-replacement.org | 2 +- .../0567-permutation-in-string.org | 2 +- ...aining-every-vowel-and-k-consonants-ii.org | 2 +- .../dsa/stack/0020-valid-parentheses.org | 2 +- .../0084-largest-rectangle-in-histogram.org | 2 +- .../0150-evaluate-reverse-polish-notation.org | 2 +- .../dsa/stack/0155-min-stack.org | 2 +- .../dsa/stack/0682-baseball-game.org | 2 +- .../dsa/stack/0726-number-of-atoms.org | 2 +- .../dsa/stack/0739-daily-temperatures.org | 2 +- .../dsa/stack/0853-car-fleet.org | 2 +- .../dsa/stack/0901-online-stock-span.org | 2 +- .../dsa/stack/1544-make-the-string-great.org | 2 +- .../0098-validate-binary-search-tree.org | 2 +- .../dsa/trees/0100-same-tree.org | 2 +- ...0102-binary-tree-level-order-traversal.org | 2 +- .../0104-maximum-depth-of-binary-tree.org | 2 +- ...ee-from-preorder-and-inorder-traversal.org | 2 +- .../dsa/trees/0110-balanced-binary-tree.org | 2 +- .../0124-binary-tree-maximum-path-sum.org | 2 +- .../0199-binary-tree-right-side-view.org | 2 +- .../dsa/trees/0226-invert-binary-tree.org | 2 +- .../0230-kth-smallest-element-in-a-bst.org | 2 +- ...ommon-ancestor-of-a-binary-search-tree.org | 2 +- ...-serialize-and-deserialize-binary-tree.org | 2 +- .../trees/0543-diameter-of-binary-tree.org | 2 +- .../trees/0572-subtree-of-another-tree.org | 2 +- .../0590-n-ary-tree-postorder-traversal.org | 2 +- ...recover-a-tree-from-preorder-traversal.org | 2 +- ...76-time-needed-to-inform-all-employees.org | 2 +- .../1448-count-good-nodes-in-binary-tree.org | 2 +- .../tries/0208-implement-trie-prefix-tree.org | 2 +- ...gn-add-and-search-words-data-structure.org | 2 +- .../dsa/tries/0212-word-search-ii.org | 2 +- .../dsa/tries/1166-design-file-system.org | 2 +- .../0011-container-with-most-water.org | 2 +- .../dsa/two-pointers/0015-3sum.org | 2 +- .../two-pointers/0042-trapping-rain-water.org | 2 +- .../two-pointers/0125-valid-palindrome.org | 2 +- .../0167-two-sum-ii-input-array-is-sorted.org | 2 +- .../dsa/two-pointers/0259-3sum-smaller.org | 2 +- .../dsa/two-pointers/0344-reverse-string.org | 2 +- org/study_deck_02/dsa/udfs.org | 2 +- org/study_deck_02/roadmap.org | 12 +- org/study_deck_02/toolkit/notes.org | 27 +++++ org/study_deck_02/toolkit/suggestions.org | 107 ++++++++++++++++++ org/study_deck_02/toolkit/tricks.org | 28 +++++ 206 files changed, 409 insertions(+), 215 deletions(-) create mode 100644 org/study_deck_02/toolkit/notes.org create mode 100644 org/study_deck_02/toolkit/suggestions.org create mode 100644 org/study_deck_02/toolkit/tricks.org diff --git a/AGENTS.md b/AGENTS.md index 214b5cc..0ddb37f 100644 --- a/AGENTS.md +++ b/AGENTS.md @@ -48,6 +48,6 @@ Periodically review this file and suggest improvements to the user if you notice - Branch: `master`, up to date with origin - DSA notes moved from `org/cpp/dsa/` to `org/study_deck_02/dsa/` -- All files carry `#+PROPERTY: STUDY_DECK_02` for org-anki export +- All files carry `#+ANKI_DECK: study_deck_02` for org-anki export - Inbox items: binary search, `using` keyword — need cards created - Possible cleanup: `org/study_deck_02/dsa/udfs.org` may be a stale draft of `org/cpp/ufds.org` diff --git a/org/study_deck_02/AGENTS.md b/org/study_deck_02/AGENTS.md index 806e695..bdde0b0 100644 --- a/org/study_deck_02/AGENTS.md +++ b/org/study_deck_02/AGENTS.md @@ -23,6 +23,8 @@ An Anki-exportable study deck for NeetCode DSA problems. org/study_deck_02/ ├── AGENTS.md ← you are here ├── roadmap.org ← generated by leetcode/extract.mjs +├── toolkit/ +│ └── tricks.org ← common patterns & templates └── dsa/ ├── arrays-hashing/ │ ├── 0217-contains-duplicate.org @@ -48,12 +50,14 @@ org/study_deck_02/ 18 topics, 199 problems (NeetCode 150). -## The `#+PROPERTY: STUDY_DECK_02` Header +## The `#+ANKI_DECK: study_deck_02` Header -Every `.org` file in this deck has `#+PROPERTY: STUDY_DECK_02` at the +Every `.org` file in this deck has `#+ANKI_DECK: study_deck_02` at the top. This tells org-anki which Anki deck to export into. Without it, the file won't be picked up by the exporter. +To override per-card, use `:ANKI_DECK:` in the properties drawer. + ## Roadmap Format Each problem in roadmap.org uses a properties drawer to keep links tidy: @@ -78,7 +82,7 @@ Each problem note links back to the roadmap via the `NEETCODE` property: ```org * TODO 0217. Contains Duplicate :easy: -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 :PROPERTIES: :NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]] :END: @@ -121,3 +125,14 @@ This deck starts with NeetCode 150. To add more: header. They'll all export to the same Anki deck. - **Flashcards** — add `** Front` / `** Back` sections to any note for Anki-style cards (see root `AGENTS.md` for format). + +## Backlinking Convention + +Every `.org` file should link back to `roadmap.org` via a property: + +- Problem notes use `:NEETCODE:` linking to the roadmap heading +- Toolkit/tricks use `:ROADMAP:` linking to a relevant problem +- Roadmap entries use `:TRICK:` linking to relevant tricks + +This keeps the web of links navigable in both directions — from +roadmap to notes, from notes to tricks, and tricks back to problems. 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 4ed1984..3410026 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0005. Longest Palindromic Substring :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0005. Longest Palindromic Substring][0005. Longest Palindromic Substring]] 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 6783783..17d125f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0070. Climbing Stairs :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0070. Climbing Stairs][0070. Climbing Stairs]] 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 8ab0788..822751d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0091. Decode Ways :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0091. Decode Ways][0091. Decode Ways]] 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 d6787ef..1c11db6 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0139. Word Break :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0139. Word Break][0139. Word Break]] 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 577d566..ce356e3 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0152. Maximum Product Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0152. Maximum Product Subarray][0152. Maximum Product Subarray]] 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 36d4f72..3fd85b6 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0198. House Robber :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0198. House Robber][0198. House Robber]] 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 30da2a1..9c58751 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0213. House Robber II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0213. House Robber II][0213. House Robber II]] 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 16c7577..0af275c 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0300. Longest Increasing Subsequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0300. Longest Increasing Subsequence][0300. Longest Increasing Subsequence]] 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 e96dd34..5408d95 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0322. Coin Change :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0322. Coin Change][0322. Coin Change]] 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 bcc5c1b..7e17c28 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0416. Partition Equal Subset Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0416. Partition Equal Subset Sum][0416. Partition Equal Subset Sum]] 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 7b96f0f..6ce3ed8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0647. Palindromic Substrings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0647. Palindromic Substrings][0647. Palindromic Substrings]] 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 3b17eb9..71401b0 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0656. Coin Path :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0656. Coin Path][0656. Coin Path]] 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 fdb2e33..ca66c88 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0746. Min Cost Climbing Stairs :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0746. Min Cost Climbing Stairs][0746. Min Cost Climbing Stairs]] 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 ddfecd7..18b2eb4 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0010. Regular Expression Matching :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0010. Regular Expression Matching][0010. Regular Expression Matching]] 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 b17824d..cb22770 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0062. Unique Paths :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0062. Unique Paths][0062. Unique Paths]] 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 fb747c4..809c361 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0072. Edit Distance :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][0072. Edit Distance]] 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 c7e2cd1..f2ee9f8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0097. Interleaving String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0097. Interleaving String][0097. Interleaving String]] 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 29f3713..7ae813e 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0115. Distinct Subsequences :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0115. Distinct Subsequences][0115. Distinct Subsequences]] 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 427cf55..ef27edd 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0309. Best Time to Buy And Sell Stock With Cooldown]] 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 e60ae42..cc91a51 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0312. Burst Balloons :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0312. Burst Balloons][0312. Burst Balloons]] 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 414f8c6..c65ae6a 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0329. Longest Increasing Path In a Matrix :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0329. Longest Increasing Path In a Matrix][0329. Longest Increasing Path In a Matrix]] 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 b4324b6..9fb1437 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0494. Target Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0494. Target Sum][0494. Target Sum]] 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 8a21757..f93d12f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0518. Coin Change II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0518. Coin Change II][0518. Coin Change II]] 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 b4fb9c6..d534cfc 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1143. Longest Common Subsequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1143. Longest Common Subsequence][1143. Longest Common Subsequence]] 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 6d90370..7535ac2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1220. Count Vowels Permutation :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1220. Count Vowels Permutation][1220. Count Vowels Permutation]] 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 8f6ccb6..a6c9d8e 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1911. Maximum Alternating Subsequence Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][1911. Maximum Alternating Subsequence Sum]] 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 ef3b8a8..b0ee24c 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0269. Alien Dictionary :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0269. Alien Dictionary][0269. Alien Dictionary]] 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 b4697c3..0eb0d0b 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0332. Reconstruct Itinerary :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0332. Reconstruct Itinerary][0332. Reconstruct Itinerary]] 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 a3bb3e4..fac7a79 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0743. Network Delay Time :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0743. Network Delay Time][0743. Network Delay Time]] 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 5c99a13..e7f9e55 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0778. Swim In Rising Water :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0778. Swim In Rising Water][0778. Swim In Rising Water]] 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 96c71b4..d7b0e05 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0787. Cheapest Flights Within K Stops :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0787. Cheapest Flights Within K Stops][0787. Cheapest Flights Within K Stops]] 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 ea1181c..dd6a678 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1584. Min Cost to Connect All Points :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1584. Min Cost to Connect All Points][1584. Min Cost to Connect All Points]] 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 8b0f4d7..440875d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][2493. Divide Nodes Into the Maximum Number of Groups]] 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 bfea644..632292f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][2812. Find the Safest Path in a Grid]] 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 6381dd9..f1a3fb7 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0001. Two Sum :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0001. Two Sum][0001. Two Sum]] 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 f8f83c1..07c5568 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0036. Valid Sudoku :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0036. Valid Sudoku][0036. Valid Sudoku]] 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 dbcbeb3..ff1c23d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0049. Group Anagrams :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0049. Group Anagrams][0049. Group Anagrams]] 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 79d7a61..cca3581 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0128. Longest Consecutive Sequence :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0128. Longest Consecutive Sequence][0128. Longest Consecutive Sequence]] 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 6800f74..8968db4 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * DONE 0217. Contains Duplicate :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][0217. Contains Duplicate]] 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 a5caef2..baceca3 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0238. Product of Array Except Self :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0238. Product of Array Except Self][0238. Product of Array Except Self]] 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 a3c9ec9..f54bde7 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 @@ -#+PROPERTY: STUDY_DECK_02 -* TODO 0242. Valid Anagram :easy: +#+ANKI_DECK: study_deck_02 +* DONE 0242. Valid Anagram :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0242. Valid Anagram][0242. Valid Anagram]] :END: @@ -26,21 +26,36 @@ Given two strings ~s~ and ~t~, return ~true~ if ~t~ is an anagram of ~s~, and ~f *Follow up:* What if the inputs contain Unicode characters? How would you adapt your solution to such a case? -** TODO Approach +** DONE Approach Write your approach here. -** TODO Python +** DONE Python #+begin_src python class Solution: def isAnagram(self, s: str, t: str) -> bool: #+end_src -** TODO C++ +** DONE C++ #+begin_src cpp +#include +#include class Solution { public: - bool isAnagram(string s, string t) { - + bool isAnagram(std::string s, std::string t) { + std::map ctr; + for (char c: s) { + ctr[c] += c; } + for (char c: t) { + if (ctr[c] == 0) { + return false; + } + ctr[c] -= 1; + if (ctr[c] == 0) { + ctr.erase(c); + } + } + return ctr.size() == 0; + } }; #+end_src 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 6204152..44dde18 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0271. Encode and Decode Strings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0271. Encode and Decode Strings][0271. Encode and Decode Strings]] 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 63a5772..da283d5 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0347. Top K Frequent Elements :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0347. Top K Frequent Elements][0347. Top K Frequent Elements]] 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 d076b6c..2f001f9 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1408. String Matching in an Array :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1408. String Matching in an Array][1408. String Matching in an Array]] 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 292d48f..726e2db 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][1769. Minimum Number of Operations to Move All Balls to Each Box]] 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 6367e5a..e4a5805 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2678. Number of Senior Citizens :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2678. Number of Senior Citizens][2678. Number of Senior Citizens]] 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 a3adf22..a41f610 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0017. Letter Combinations of a Phone Number :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0017. Letter Combinations of a Phone Number][0017. Letter Combinations of a Phone Number]] 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 2e97c0a..63813ed 100644 --- a/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org +++ b/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0022. Generate Parentheses :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0022. Generate Parentheses][0022. Generate Parentheses]] 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 489eaa6..028daf9 100644 --- a/org/study_deck_02/dsa/backtracking/0039-combination-sum.org +++ b/org/study_deck_02/dsa/backtracking/0039-combination-sum.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0039. Combination Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0039. Combination Sum][0039. Combination Sum]] 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 06d9b62..03dfb33 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0040. Combination Sum II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0040. Combination Sum II][0040. Combination Sum II]] diff --git a/org/study_deck_02/dsa/backtracking/0046-permutations.org b/org/study_deck_02/dsa/backtracking/0046-permutations.org index 59910d5..a3d2116 100644 --- a/org/study_deck_02/dsa/backtracking/0046-permutations.org +++ b/org/study_deck_02/dsa/backtracking/0046-permutations.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0046. Permutations :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0046. Permutations][0046. Permutations]] 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 db147ce..9f8149f 100644 --- a/org/study_deck_02/dsa/backtracking/0051-n-queens.org +++ b/org/study_deck_02/dsa/backtracking/0051-n-queens.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0051. N Queens :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0051. N Queens][0051. N Queens]] 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 c83d452..bd08bee 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0052. N Queens II :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0052. N Queens II][0052. N Queens II]] diff --git a/org/study_deck_02/dsa/backtracking/0077-combinations.org b/org/study_deck_02/dsa/backtracking/0077-combinations.org index cefab37..40ffb02 100644 --- a/org/study_deck_02/dsa/backtracking/0077-combinations.org +++ b/org/study_deck_02/dsa/backtracking/0077-combinations.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0077. Combinations :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0077. Combinations][0077. Combinations]] diff --git a/org/study_deck_02/dsa/backtracking/0078-subsets.org b/org/study_deck_02/dsa/backtracking/0078-subsets.org index 88b6eda..6c80c31 100644 --- a/org/study_deck_02/dsa/backtracking/0078-subsets.org +++ b/org/study_deck_02/dsa/backtracking/0078-subsets.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0078. Subsets :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0078. Subsets][0078. Subsets]] 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 dda43ce..c04732e 100644 --- a/org/study_deck_02/dsa/backtracking/0079-word-search.org +++ b/org/study_deck_02/dsa/backtracking/0079-word-search.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0079. Word Search :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0079. Word Search][0079. Word Search]] 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 0b0281e..cbb5cc9 100644 --- a/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org +++ b/org/study_deck_02/dsa/backtracking/0090-subsets-ii.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0090. Subsets II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0090. Subsets II][0090. Subsets II]] 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 3595c3c..2df255d 100644 --- a/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org +++ b/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0131. Palindrome Partitioning :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0131. Palindrome Partitioning][0131. Palindrome Partitioning]] 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 2e2bbb7..c428761 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0351. Android Unlock Patterns :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0351. Android Unlock Patterns][0351. Android Unlock Patterns]] 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 ec0f000..b07ddb6 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1079. Letter Tile Possibilities :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1079. Letter Tile Possibilities][1079. Letter Tile Possibilities]] 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 6b15743..7ba99c8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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]] 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 bc41904..61a58e0 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0004. Median of Two Sorted Arrays :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0004. Median of Two Sorted Arrays][0004. Median of Two Sorted Arrays]] 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 07ac07f..8fab337 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0033. Search In Rotated Sorted Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0033. Search In Rotated Sorted Array][0033. Search In Rotated Sorted Array]] 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 356b285..21e1eb3 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0074. Search a 2D Matrix :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0074. Search a 2D Matrix][0074. Search a 2D Matrix]] 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 d7fcc3d..a7d0d17 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0153. Find Minimum In Rotated Sorted Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][0153. Find Minimum In Rotated Sorted Array]] 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 262bf84..6c93c05 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0704. Binary Search :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0704. Binary Search][0704. Binary Search]] 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 c8416b2..1ebba44 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0719. Find K-th Smallest Pair Distance :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0719. Find K-th Smallest Pair Distance][0719. Find K-th Smallest Pair Distance]] 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 1333e2c..0168af3 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0875. Koko Eating Bananas :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][0875. Koko Eating Bananas]] 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 ca0b00f..cfcab6c 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0981. Time Based Key Value Store :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0981. Time Based Key Value Store][0981. Time Based Key Value Store]] 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 f65f529..1a17401 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2300. Successful Pairs of Spells and Potions :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2300. Successful Pairs of Spells and Potions][2300. Successful Pairs of Spells and Potions]] 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 f4a9174..f181aba 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0007. Reverse Integer :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0007. Reverse Integer][0007. Reverse Integer]] 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 17410f8..4a7cb64 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0136. Single Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0136. Single Number][0136. Single Number]] 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 290a802..3b56eb1 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0190. Reverse Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0190. Reverse Bits][0190. Reverse Bits]] 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 23760ae..6ac3a06 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0191. Number of 1 Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0191. Number of 1 Bits][0191. Number of 1 Bits]] 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 edc6241..dfdfcf5 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0231. Power of Two :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0231. Power of Two][0231. Power of Two]] 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 92271d5..ee09552 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0260. Single Number III :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0260. Single Number III][0260. Single Number III]] 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 73b4d57..57cbeb2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0268. Missing Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0268. Missing Number][0268. Missing Number]] 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 f4bc629..4a9301d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0338. Counting Bits :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0338. Counting Bits][0338. Counting Bits]] 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 4658956..24aa674 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0371. Sum of Two Integers :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0371. Sum of Two Integers][0371. Sum of Two Integers]] 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 01699f4..3ffe0be 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2220. Minimum Bit Flips to Convert Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][2220. Minimum Bit Flips to Convert Number]] 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 0db5b3e..8a72af2 100644 --- a/org/study_deck_02/dsa/graphs/0127-word-ladder.org +++ b/org/study_deck_02/dsa/graphs/0127-word-ladder.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0127. Word Ladder :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0127. Word Ladder][0127. Word Ladder]] 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 bb50c58..0cd67a4 100644 --- a/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org +++ b/org/study_deck_02/dsa/graphs/0130-surrounded-regions.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0130. Surrounded Regions :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0130. Surrounded Regions][0130. Surrounded Regions]] 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 c1177b4..546c215 100644 --- a/org/study_deck_02/dsa/graphs/0133-clone-graph.org +++ b/org/study_deck_02/dsa/graphs/0133-clone-graph.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0133. Clone Graph :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0133. Clone Graph][0133. Clone Graph]] 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 49df303..df39783 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0200. Number of Islands :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0200. Number of Islands][0200. Number of Islands]] 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 bd88a87..e9c6e7e 100644 --- a/org/study_deck_02/dsa/graphs/0207-course-schedule.org +++ b/org/study_deck_02/dsa/graphs/0207-course-schedule.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0207. Course Schedule :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0207. Course Schedule][0207. Course Schedule]] 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 6049aae..2afbf77 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0210. Course Schedule II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0210. Course Schedule II][0210. Course Schedule II]] 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 cb1b800..2246c70 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0261. Graph Valid Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0261. Graph Valid Tree][0261. Graph Valid Tree]] 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 38ea24b..c117c1f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0286. Walls And Gates :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0286. Walls And Gates][0286. Walls And Gates]] 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 0e28168..ba1ec88 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0323. Number of Connected Components In An Undirected Graph]] 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 b06fcc1..c253a32 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0417. Pacific Atlantic Water Flow :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0417. Pacific Atlantic Water Flow][0417. Pacific Atlantic Water Flow]] 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 a12623b..c6459c2 100644 --- a/org/study_deck_02/dsa/graphs/0684-redundant-connection.org +++ b/org/study_deck_02/dsa/graphs/0684-redundant-connection.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0684. Redundant Connection :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0684. Redundant Connection][0684. Redundant Connection]] 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 1f3d6b0..fc4e9f8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0695. Max Area of Island :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0695. Max Area of Island][0695. Max Area of Island]] 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 f7cb1c9..340abac 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0802. Find Eventual Safe States :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0802. Find Eventual Safe States][0802. Find Eventual Safe States]] 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 931feda..741cb24 100644 --- a/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org +++ b/org/study_deck_02/dsa/graphs/0994-rotting-oranges.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0994. Rotting Oranges :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0994. Rotting Oranges][0994. Rotting Oranges]] 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 4b556e3..f3757e2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1905. Count Sub Islands :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1905. Count Sub Islands][1905. Count Sub Islands]] 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 92f323d..e48d433 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2092. Find All People With Secret :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2092. Find All People With Secret][2092. Find All People With Secret]] 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 0a8dd57..82d3730 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][2658. Maximum Number of Fish in a Grid]] 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 24582b2..2a23a86 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2924. Find Champion II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2924. Find Champion II][2924. Find Champion II]] 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 4db29be..732bd92 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0045. Jump Game II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0045. Jump Game II][0045. Jump Game II]] 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 dc7ec6a..dae5143 100644 --- a/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org +++ b/org/study_deck_02/dsa/greedy/0053-maximum-subarray.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0053. Maximum Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0053. Maximum Subarray][0053. Maximum Subarray]] 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 ef449cc..9bab65c 100644 --- a/org/study_deck_02/dsa/greedy/0055-jump-game.org +++ b/org/study_deck_02/dsa/greedy/0055-jump-game.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0055. Jump Game :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0055. Jump Game][0055. Jump Game]] 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 8bb53cd..341e5d6 100644 --- a/org/study_deck_02/dsa/greedy/0134-gas-station.org +++ b/org/study_deck_02/dsa/greedy/0134-gas-station.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0134. Gas Station :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0134. Gas Station][0134. Gas Station]] 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 614d63b..56d93b8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0678. Valid Parenthesis String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0678. Valid Parenthesis String][0678. Valid Parenthesis String]] 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 53af6ba..2aa4417 100644 --- a/org/study_deck_02/dsa/greedy/0763-partition-labels.org +++ b/org/study_deck_02/dsa/greedy/0763-partition-labels.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0763. Partition Labels :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0763. Partition Labels][0763. Partition Labels]] 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 0dbd79b..1e33cd8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0846. Hand of Straights :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0846. Hand of Straights][0846. Hand of Straights]] 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 daa6ae4..4a8d726 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0945. Minimum Increment to Make Array Unique :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0945. Minimum Increment to Make Array Unique][0945. Minimum Increment to Make Array Unique]] 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 4a4dfb5..74c8663 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0978. Longest Turbulent Subarray :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0978. Longest Turbulent Subarray][0978. Longest Turbulent Subarray]] 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 5d5cda2..99eb408 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1871. Jump Game VII :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1871. Jump Game VII][1871. Jump Game VII]] 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 0fadf2f..e6c36db 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1899. Merge Triplets to Form Target Triplet :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1899. Merge Triplets to Form Target Triplet][1899. Merge Triplets to Form Target Triplet]] 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 8cc427f..4ad671a 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0215. Kth Largest Element In An Array :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0215. Kth Largest Element In An Array][0215. Kth Largest Element In An Array]] 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 ea1836f..c600871 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0295. Find Median From Data Stream :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0295. Find Median From Data Stream][0295. Find Median From Data Stream]] 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 054ca96..ae3101d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0355. Design Twitter :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0355. Design Twitter][0355. Design Twitter]] 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 1110bcb..cc137e6 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0621. Task Scheduler :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0621. Task Scheduler][0621. Task Scheduler]] 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 00bc438..859b47f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0703. Kth Largest Element In a Stream :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0703. Kth Largest Element In a Stream][0703. Kth Largest Element In a Stream]] 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 514ac58..2f29d59 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0973. K Closest Points to Origin :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0973. K Closest Points to Origin][0973. K Closest Points to Origin]] 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 63d3f3a..90e8f0f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1046. Last Stone Weight :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1046. Last Stone Weight][1046. Last Stone Weight]] 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 5804f58..8b84f71 100644 --- a/org/study_deck_02/dsa/intervals/0056-merge-intervals.org +++ b/org/study_deck_02/dsa/intervals/0056-merge-intervals.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0056. Merge Intervals :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0056. Merge Intervals][0056. Merge Intervals]] 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 15a2752..d810e00 100644 --- a/org/study_deck_02/dsa/intervals/0057-insert-interval.org +++ b/org/study_deck_02/dsa/intervals/0057-insert-interval.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0057. Insert Interval :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0057. Insert Interval][0057. Insert Interval]] 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 8cc1df6..bbacce6 100644 --- a/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org +++ b/org/study_deck_02/dsa/intervals/0252-meeting-rooms.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0252. Meeting Rooms :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0252. Meeting Rooms][0252. Meeting Rooms]] 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 ab9fd77..ac4f7d5 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0253. Meeting Rooms II :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0253. Meeting Rooms II][0253. Meeting Rooms II]] 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 aaa4eb6..41bd809 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0435. Non Overlapping Intervals :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0435. Non Overlapping Intervals][0435. Non Overlapping Intervals]] 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 d650452..3070cdc 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0986. Interval List Intersections :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0986. Interval List Intersections][0986. Interval List Intersections]] 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 90bf751..f2f19d2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1851. Minimum Interval to Include Each Query :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1851. Minimum Interval to Include Each Query][1851. Minimum Interval to Include Each Query]] 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 310bcf9..1a6e88c 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0002. Add Two Numbers :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0002. Add Two Numbers][0002. Add Two Numbers]] 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 aac68eb..7ce86b2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0019. Remove Nth Node From End of List]] 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 a67d8ac..0f77e7a 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0021. Merge Two Sorted Lists :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0021. Merge Two Sorted Lists][0021. Merge Two Sorted Lists]] 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 0fe160a..0fe1087 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0023. Merge K Sorted Lists :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0023. Merge K Sorted Lists][0023. Merge K Sorted Lists]] 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 354330e..1c1b415 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0025. Reverse Nodes In K Group :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0025. Reverse Nodes In K Group][0025. Reverse Nodes In K Group]] 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 d9ff203..4b48af7 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0138. Copy List With Random Pointer :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0138. Copy List With Random Pointer][0138. Copy List With Random Pointer]] 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 a4a980e..a8a7ab6 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0141. Linked List Cycle :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0141. Linked List Cycle][0141. Linked List Cycle]] 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 19d1f80..5e45faf 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0143. Reorder List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0143. Reorder List][0143. Reorder List]] 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 b2138b3..7e5aeeb 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0146. LRU Cache :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0146. LRU Cache][0146. LRU Cache]] 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 c1299a9..d9a323e 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0206. Reverse Linked List :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0206. Reverse Linked List][0206. Reverse Linked List]] 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 b868143..47228ac 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0287. Find The Duplicate Number :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0287. Find The Duplicate Number][0287. Find The Duplicate Number]] 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 0ad3882..396eed2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0725. Split Linked List in Parts :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0725. Split Linked List in Parts][0725. Split Linked List in Parts]] 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 2b58f60..f4d6f76 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1472. Design Browser History :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1472. Design Browser History][1472. Design Browser History]] 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 88b7f9a..9af6c99 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1721. Swapping Nodes in a Linked List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1721. Swapping Nodes in a Linked List][1721. Swapping Nodes in a Linked List]] 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 d001c84..10a329d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2487. Remove Nodes From Linked List :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2487. Remove Nodes From Linked List][2487. Remove Nodes From Linked List]] 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 32aebcb..24887ec 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0009. Palindrome Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0009. Palindrome Number][0009. Palindrome Number]] 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 eb7836a..5373380 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0012. Integer to Roman :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0012. Integer to Roman][0012. Integer to Roman]] 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 6282d96..fd47e39 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0043. Multiply Strings :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0043. Multiply Strings][0043. Multiply Strings]] 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 bbc9845..94a75a0 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0048. Rotate Image :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0048. Rotate Image][0048. Rotate Image]] 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 3e383a2..543fff2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0050. Pow(x, n) :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0050. Pow(x, n)][Roadmap]] 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 d651768..1474ae9 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0054. Spiral Matrix :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0054. Spiral Matrix][0054. Spiral Matrix]] 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 adc88a2..ee7f35d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0066. Plus One :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0066. Plus One][0066. Plus One]] 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 45d5e44..626ce3d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0073. Set Matrix Zeroes :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0073. Set Matrix Zeroes][0073. Set Matrix Zeroes]] 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 1704d38..abb283f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0202. Happy Number :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0202. Happy Number][0202. Happy Number]] 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 037d80f..aa4cc38 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0296. Best Meeting Point :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0296. Best Meeting Point][0296. Best Meeting Point]] 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 056acdc..0966611 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0840. Magic Squares In Grid :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0840. Magic Squares In Grid][0840. Magic Squares In Grid]] 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 dfc1aa0..693deb1 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][1780. Check if Number is a Sum of Powers of Three]] 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 46bab68..eaa5aed 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2013. Detect Squares :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2013. Detect Squares][2013. Detect Squares]] 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 cfcaf84..47fa323 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 2326. Spiral Matrix IV :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*2326. Spiral Matrix IV][2326. Spiral Matrix IV]] 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 6ab8d54..b2e3cdb 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][2698. Find the Punishment Number of an Integer]] 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 6a72d1b..bc90f04 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0003. Longest Substring Without Repeating Characters :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0003. Longest Substring Without Repeating Characters][0003. Longest Substring Without Repeating Characters]] 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 7ee6631..1f56978 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0076. Minimum Window Substring :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0076. Minimum Window Substring][0076. Minimum Window Substring]] 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 52ed86f..2feb06b 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0121. Best Time to Buy And Sell Stock]] 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 94a2e94..25e88d8 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0239. Sliding Window Maximum :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0239. Sliding Window Maximum][0239. Sliding Window Maximum]] 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 0c76e10..43e550f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0424. Longest Repeating Character Replacement :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0424. Longest Repeating Character Replacement][0424. Longest Repeating Character Replacement]] 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 27b3e9b..d12f7cf 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0567. Permutation In String :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0567. Permutation In String][0567. Permutation In String]] 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 daa1302..6910413 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][3306. Count of Substrings Containing Every Vowel and K Consonants II]] 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 c958929..bc27d89 100644 --- a/org/study_deck_02/dsa/stack/0020-valid-parentheses.org +++ b/org/study_deck_02/dsa/stack/0020-valid-parentheses.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0020. Valid Parentheses :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0020. Valid Parentheses][0020. Valid Parentheses]] 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 386c51b..c1fbe22 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0084. Largest Rectangle In Histogram :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0084. Largest Rectangle In Histogram][0084. Largest Rectangle In Histogram]] 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 c86b5e8..8a8f1c1 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0150. Evaluate Reverse Polish Notation :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0150. Evaluate Reverse Polish Notation][0150. Evaluate Reverse Polish Notation]] 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 85beb9f..cdee1a1 100644 --- a/org/study_deck_02/dsa/stack/0155-min-stack.org +++ b/org/study_deck_02/dsa/stack/0155-min-stack.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0155. Min Stack :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0155. Min Stack][0155. Min Stack]] 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 0312020..8f90af1 100644 --- a/org/study_deck_02/dsa/stack/0682-baseball-game.org +++ b/org/study_deck_02/dsa/stack/0682-baseball-game.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0682. Baseball Game :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0682. Baseball Game][0682. Baseball Game]] 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 5f6f7a1..3cb93ee 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0726. Number of Atoms :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0726. Number of Atoms][0726. Number of Atoms]] 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 ad12887..158734e 100644 --- a/org/study_deck_02/dsa/stack/0739-daily-temperatures.org +++ b/org/study_deck_02/dsa/stack/0739-daily-temperatures.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0739. Daily Temperatures :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0739. Daily Temperatures][0739. Daily Temperatures]] 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 f64f7d4..c654a76 100644 --- a/org/study_deck_02/dsa/stack/0853-car-fleet.org +++ b/org/study_deck_02/dsa/stack/0853-car-fleet.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0853. Car Fleet :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0853. Car Fleet][0853. Car Fleet]] 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 e0cefb1..aa3bc8a 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0901. Online Stock Span :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0901. Online Stock Span][0901. Online Stock Span]] 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 789b0ec..95fb110 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1544. Make The String Great :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1544. Make The String Great][1544. Make The String Great]] 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 d651edd..95b551e 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0098. Validate Binary Search Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0098. Validate Binary Search Tree][0098. Validate Binary Search Tree]] 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 88ed164..bdcee07 100644 --- a/org/study_deck_02/dsa/trees/0100-same-tree.org +++ b/org/study_deck_02/dsa/trees/0100-same-tree.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0100. Same Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0100. Same Tree][0100. Same Tree]] 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 010b249..d9d5965 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0102. Binary Tree Level Order Traversal :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0102. Binary Tree Level Order Traversal][0102. Binary Tree Level Order Traversal]] 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 8a774ca..d577f31 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0104. Maximum Depth of Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0104. Maximum Depth of Binary Tree][0104. Maximum Depth of Binary Tree]] 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 0728d3f..216dc0b 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0105. Construct Binary Tree From Preorder And Inorder Traversal]] 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 dc7c91b..46abefa 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0110. Balanced Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0110. Balanced Binary Tree][0110. Balanced Binary Tree]] 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 7885395..aa4c5ae 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0124. Binary Tree Maximum Path Sum :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0124. Binary Tree Maximum Path Sum][0124. Binary Tree Maximum Path Sum]] 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 a20aa13..1c96e68 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0199. Binary Tree Right Side View :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0199. Binary Tree Right Side View][0199. Binary Tree Right Side View]] 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 60a0f2d..a345c93 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0226. Invert Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0226. Invert Binary Tree][0226. Invert Binary Tree]] 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 7d4b4bf..e06f0ed 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0230. Kth Smallest Element In a Bst :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0230. Kth Smallest Element In a Bst][0230. Kth Smallest Element In a Bst]] 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 59226c6..7156571 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0235. Lowest Common Ancestor of a Binary Search Tree]] 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 74a1151..68f8643 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0297. Serialize And Deserialize Binary Tree :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][0297. Serialize And Deserialize Binary Tree]] 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 83bf1ba..054c40e 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0543. Diameter of Binary Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0543. Diameter of Binary Tree][0543. Diameter of Binary Tree]] 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 8619a0b..e682d94 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0572. Subtree of Another Tree :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0572. Subtree of Another Tree][0572. Subtree of Another Tree]] 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 231ff90..3cee02f 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0590. N-ary Tree Postorder Traversal :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0590. N-ary Tree Postorder Traversal][0590. N-ary Tree Postorder Traversal]] 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 198b706..8f109e9 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1028. Recover a Tree From Preorder Traversal :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][1028. Recover a Tree From Preorder Traversal]] 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 1d70806..5713ef4 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1376. Time Needed to Inform All Employees :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1376. Time Needed to Inform All Employees][1376. Time Needed to Inform All Employees]] 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 f01dbb3..7f5accc 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1448. Count Good Nodes In Binary Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1448. Count Good Nodes In Binary Tree][1448. Count Good Nodes In Binary Tree]] 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 d595f59..7d186b1 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0208. Implement Trie Prefix Tree :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0208. Implement Trie Prefix Tree][0208. Implement Trie Prefix Tree]] 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 4ea4831..03f06c2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0211. Design Add And Search Words Data Structure]] 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 0c7c51d..32d5ca2 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0212. Word Search II :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0212. Word Search II][0212. Word Search II]] 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 0dc8425..62c2caa 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 1166. Design File System :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*1166. Design File System][1166. Design File System]] 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 41ea597..a52033d 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0011. Container With Most Water :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0011. Container With Most Water][0011. Container With Most Water]] 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 1e65a37..02cc369 100644 --- a/org/study_deck_02/dsa/two-pointers/0015-3sum.org +++ b/org/study_deck_02/dsa/two-pointers/0015-3sum.org @@ -1,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0015. 3Sum :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0015. 3Sum][0015. 3Sum]] 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 d6d0efa..3482e31 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0042. Trapping Rain Water :hard: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0042. Trapping Rain Water][0042. Trapping Rain Water]] 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 671e5d8..dcf9711 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0125. Valid Palindrome :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0125. Valid Palindrome][0125. Valid Palindrome]] 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 c56f33e..46b6437 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: 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][0167. Two Sum II Input Array Is Sorted]] 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 e734c09..e5400fb 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0259. 3Sum Smaller :medium: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0259. 3Sum Smaller][0259. 3Sum Smaller]] 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 ce52af0..4c7dab3 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,4 +1,4 @@ -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * TODO 0344. Reverse String :easy: :PROPERTIES: :NEETCODE: [[file:../../roadmap.org::*0344. Reverse String][0344. Reverse String]] diff --git a/org/study_deck_02/dsa/udfs.org b/org/study_deck_02/dsa/udfs.org index 81ebd60..b40461b 100644 --- a/org/study_deck_02/dsa/udfs.org +++ b/org/study_deck_02/dsa/udfs.org @@ -1,5 +1,5 @@ #+title: Udfs -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 * impl #+begin_src cpp #include diff --git a/org/study_deck_02/roadmap.org b/org/study_deck_02/roadmap.org index f6c3e2a..660c325 100644 --- a/org/study_deck_02/roadmap.org +++ b/org/study_deck_02/roadmap.org @@ -1,12 +1,12 @@ #+TITLE: NeetCode Roadmap -#+PROPERTY: STUDY_DECK_02 +#+ANKI_DECK: study_deck_02 #+DATE: 2026-06-01 #+TODO: TODO DONE #+STARTUP: overview Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]] -* TODO Arrays & Hashing [1/12] +* TODO Arrays & Hashing [2/12] ** DONE 0217. Contains Duplicate :easy: :PROPERTIES: @@ -19,16 +19,18 @@ Source: [[https://neetcode.io/roadmap][neetcode.io/roadmap]] *** DONE Python *** DONE C++ Notes: [[file:dsa/arrays-hashing/0217-contains-duplicate.org]] -** TODO 0242. Valid Anagram :easy: +** DONE 0242. Valid Anagram :easy: :PROPERTIES: :LEETCODE: [[https://leetcode.com/problems/valid-anagram/][Problem]] :CPP: [[https://github.com/neetcode-gh/leetcode/blob/main/cpp/0242-valid-anagram.cpp][Solution]] :PYTHON: [[https://github.com/neetcode-gh/leetcode/blob/main/python/0242-valid-anagram.py][Solution]] :VIDEO: [[https://youtube.com/watch?v=9UtInBqnCgA][Watch]] +:RELATED: [[https://leetcode.com/problems/group-anagrams/][049. Group Anagrams]], [[https://leetcode.com/problems/ransom-note/][383. Ransom Note]], [[https://leetcode.com/problems/first-unique-character-in-a-string/][387. First Unique Character]] +:TRICK: [[file:toolkit/tricks.org::*Task: Count character frequencies faster than map][Count char freq faster than map]] :END: -*** TODO Python -*** TODO C++ +*** DONE Python +*** DONE C++ Notes: [[file:dsa/arrays-hashing/0242-valid-anagram.org]] ** TODO 2678. Number of Senior Citizens :easy: :PROPERTIES: diff --git a/org/study_deck_02/toolkit/notes.org b/org/study_deck_02/toolkit/notes.org new file mode 100644 index 0000000..c279c34 --- /dev/null +++ b/org/study_deck_02/toolkit/notes.org @@ -0,0 +1,27 @@ +#+ANKI_DECK: study_deck_02 +#+title: Notes + +* DONE 0242. Valid Anagram :easy:arrays:hashing:counting: +:PROPERTIES: +:ROADMAP: [[file:../roadmap.org::*0242. Valid Anagram][0242. Valid Anagram]] +:END: + +** Approach +Frequency counter with fixed-size array (Alpha Frequency Array trick). +Early exit on size mismatch. Single pass over both strings. + +** C++ +#+begin_src cpp +class Solution { +public: + bool isAnagram(std::string s, std::string t) { + if (s.size() != t.size()) return false; + std::array freq{}; + for (int i = 0; i < s.size(); i++) { + freq[s[i] - 'a']++; + freq[t[i] - 'a']--; + } + return std::all_of(freq.begin(), freq.end(), [](int x){ return x == 0; }); + } +}; +#+end_src diff --git a/org/study_deck_02/toolkit/suggestions.org b/org/study_deck_02/toolkit/suggestions.org new file mode 100644 index 0000000..938ece2 --- /dev/null +++ b/org/study_deck_02/toolkit/suggestions.org @@ -0,0 +1,107 @@ +#+ANKI_DECK: study_deck_02 +#+TITLE: DSA Tricks & Patterns + +* Common Patterns +** Sliding Window +Use when: contiguous subarray/substring, "longest/shortest/most k" +Template: +#+begin_src cpp +int left = 0; +for (int right = 0; right < n; right++) { + // expand window + while (/* window invalid */) { + // shrink window + left++; + } + // update answer +} +#+end_src + +** Two Pointers +Use when: sorted array, palindrome, pair sum +Template: +#+begin_src cpp +int l = 0, r = n - 1; +while (l < r) { + if (/* condition */) l++; + else r--; +} +#+end_src + +** Binary Search +Use when: monotonic function, "minimum maximum", "first/last" +Template: +#+begin_src cpp +int lo = 0, hi = n; +while (lo < hi) { + int mid = lo + (hi - lo) / 2; + if (/* check(mid) */) hi = mid; + else lo = mid + 1; +} +#+end_src + +** BFS vs DFS +- BFS: shortest path (unweighted), level-order, queue +- DFS: path existence, backtracking, cycle detection, stack/recursion + +** Union-Find +Use when: connected components, cycle detection, grouping +- Path compression + union by rank = O(α(n)) + +** Monotonic Stack +Use when: next greater/smaller element, stock span +Template: +#+begin_src cpp +stack st; +for (int i = 0; i < n; i++) { + while (!st.empty() && st.top() < arr[i]) { + // process st.top() + st.pop(); + } + st.push(i); +} +#+end_src + +** Topological Sort +Use when: dependency ordering, DAG, course schedule +- Kahn's (BFS + in-degree) or DFS post-order reversal + +** Dijkstra's +Use when: shortest path, non-negative weights, weighted graph +- Priority queue + relaxation + +** Bit Manipulation Tricks +- ~x = -x - 1 +- x & (x - 1) clears lowest set bit +- x & -x isolates lowest set bit +- XOR swap: a ^= b; b ^= a; a ^= b; + +** KMP / Z-Algorithm +Use when: pattern matching, repeated substrings +- KMP: O(n + m), failure function +- Z: O(n + m), Z-array + +** DP State Design +- Ask: what do I need to track? (index, remaining, previous choice) +- State = f(index, constraint1, constraint2, ...) +- Space optimize with rolling array when only previous row needed + +** Graph Coloring (2-coloring / Bipartite) +Use when: odd cycle check, two groups +- BFS/DFS alternating colors + +** Prefix Sum +Use when: subarray sum, range queries +- Build once O(n), query O(1) + +** Trie +Use when: prefix search, autocomplete, word dictionary +- Each node = character, path = word + +** Heap / Priority Queue +Use when: k-th element, merge k sorted, median maintenance +- C++: `priority_queue` (max-heap by default) + +** Fast & Slow Pointers +Use when: cycle detection, linked list midpoint +- Floyd's tortoise and hare diff --git a/org/study_deck_02/toolkit/tricks.org b/org/study_deck_02/toolkit/tricks.org new file mode 100644 index 0000000..677995a --- /dev/null +++ b/org/study_deck_02/toolkit/tricks.org @@ -0,0 +1,28 @@ +#+ANKI_DECK: study_deck_02 +#+TITLE: DSA Tricks & Patterns + +* Task: Count character frequencies faster than map :dsa:counting:array:string:retrieval::production: +:PROPERTIES: +:ANKI_NOTE_TYPE: Basic +:ROADMAP: [[file:../roadmap.org::*0242. Valid Anagram][0242. Valid Anagram]] +:ANKI_NOTE_ID: 1780308820578 +:END: + +** Front +:PROPERTIES: +:ANKI_NOTE_ID: 1780308820574 +:END: +Write C++ to count character frequencies in a string using a +fixed-size array instead of ~std::map~ (assume lowercase a-z only). + +** Back +:PROPERTIES: +:ANKI_NOTE_ID: 1780308820567 +:END: +#+begin_src cpp +std::array freq{}; +for (char c : s) freq[c - 'a']++; +#+end_src + +*Why:* O(1) per access vs O(log n) for ~std::map~. Use when alphabet +is bounded and small.