upd

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]

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]]