upd

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

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

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

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

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

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

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

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

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

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

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

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

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