upd

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

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

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

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

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

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

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

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