upd

2026-06-01 18:12:40 +08:00
parent c9fe2fab76
commit 0f9312eaee
206 changed files with 409 additions and 215 deletions
@@ -48,6 +48,6 @@ Periodically review this file and suggest improvements to the user if you notice
 <!-- Updated automatically by /self-improve. Remove stale entries. -->
 - 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`
@@ -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.
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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 <map>
+#include <string>
 class Solution {
 public:
-    bool isAnagram(string s, string t) {
-        
+  bool isAnagram(std::string s, std::string t) {
+    std::map<char, int> 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
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
@@ -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]]
--- a/Show More
+++ b/Show More