fix: add file: prefix to org-mode links for Emacs resolution

Emorg org-mode requires [[file:path]] syntax for file links to be clickable. Updated both extract.mjs and scaffold-notes.mjs generators, and fixed all 200 existing note files.
2026-06-01 17:06:27 +08:00
parent a50f4a121b
commit d674451070
203 changed files with 401 additions and 401 deletions
@@ -83,7 +83,7 @@ Scaffolded by `scaffold-notes.mjs`. Template:
 * TODO 0217. Contains Duplicate :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
 :END:
 #+begin_src cpp
@@ -248,7 +248,7 @@ function buildOrg(sortedNodes, problemsByTopic) {
      lines.push("");
      lines.push(`*** TODO Python`);
      lines.push(`*** TODO C++`);
-      lines.push(`Notes: [[${notesFile}]]`);
+      lines.push(`Notes: [[file:${notesFile}]]`);
    }
    lines.push("");
  }
@@ -41,7 +41,7 @@ for (const line of roadmap.split("\n")) {
    const content = `* TODO ${num}. ${name} :${diff}:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[${relPath}][Roadmap]]
+:NEETCODE: [[file:${relPath}][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0005. Longest Palindromic Substring :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0005. Longest Palindromic Substring][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0070. Climbing Stairs :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0070. Climbing Stairs][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0070. Climbing Stairs][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0091. Decode Ways :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0091. Decode Ways][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0091. Decode Ways][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0139. Word Break :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0139. Word Break][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0139. Word Break][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0152. Maximum Product Subarray :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0152. Maximum Product Subarray][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0198. House Robber :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0198. House Robber][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0198. House Robber][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0213. House Robber II :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0213. House Robber II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0213. House Robber II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0300. Longest Increasing Subsequence :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0300. Longest Increasing Subsequence][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0322. Coin Change :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0322. Coin Change][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0322. Coin Change][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0416. Partition Equal Subset Sum :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0416. Partition Equal Subset Sum][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0647. Palindromic Substrings :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0647. Palindromic Substrings][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0647. Palindromic Substrings][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0656. Coin Path :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0656. Coin Path][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0656. Coin Path][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0746. Min Cost Climbing Stairs :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0746. Min Cost Climbing Stairs][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0010. Regular Expression Matching :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0010. Regular Expression Matching][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0010. Regular Expression Matching][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0062. Unique Paths :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0062. Unique Paths][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0062. Unique Paths][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0072. Edit Distance :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0072. Edit Distance][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0097. Interleaving String :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0097. Interleaving String][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0097. Interleaving String][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0115. Distinct Subsequences :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0115. Distinct Subsequences][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0115. Distinct Subsequences][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0309. Best Time to Buy And Sell Stock With Cooldown :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0309. Best Time to Buy And Sell Stock With Cooldown][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0312. Burst Balloons :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0312. Burst Balloons][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0312. Burst Balloons][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0329. Longest Increasing Path In a Matrix :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0329. Longest Increasing Path In a Matrix][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0494. Target Sum :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0494. Target Sum][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0494. Target Sum][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0518. Coin Change II :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0518. Coin Change II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0518. Coin Change II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1143. Longest Common Subsequence :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1143. Longest Common Subsequence][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1220. Count Vowels Permutation :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1220. Count Vowels Permutation][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1911. Maximum Alternating Subsequence Sum :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0269. Alien Dictionary :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0269. Alien Dictionary][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0269. Alien Dictionary][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0332. Reconstruct Itinerary :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0332. Reconstruct Itinerary][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0743. Network Delay Time :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0743. Network Delay Time][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0743. Network Delay Time][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0778. Swim In Rising Water :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0778. Swim In Rising Water][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0778. Swim In Rising Water][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0787. Cheapest Flights Within K Stops :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0787. Cheapest Flights Within K Stops][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1584. Min Cost to Connect All Points :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1584. Min Cost to Connect All Points][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2493. Divide Nodes Into the Maximum Number of Groups :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2493. Divide Nodes Into the Maximum Number of Groups][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2812. Find the Safest Path in a Grid :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2812. Find the Safest Path in a Grid][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0001. Two Sum :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0001. Two Sum][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0001. Two Sum][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0036. Valid Sudoku :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0036. Valid Sudoku][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0036. Valid Sudoku][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0049. Group Anagrams :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0049. Group Anagrams][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0049. Group Anagrams][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0128. Longest Consecutive Sequence :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0128. Longest Consecutive Sequence][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0217. Contains Duplicate :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0217. Contains Duplicate][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0238. Product of Array Except Self :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0238. Product of Array Except Self][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0238. Product of Array Except Self][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0242. Valid Anagram :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0242. Valid Anagram][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0242. Valid Anagram][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0271. Encode and Decode Strings :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0271. Encode and Decode Strings][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0347. Top K Frequent Elements :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0347. Top K Frequent Elements][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1408. String Matching in an Array :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1408. String Matching in an Array][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1408. String Matching in an Array][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1769. Minimum Number of Operations to Move All Balls to Each Box :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1769. Minimum Number of Operations to Move All Balls to Each Box][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2678. Number of Senior Citizens :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2678. Number of Senior Citizens][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0017. Letter Combinations of a Phone Number :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0017. Letter Combinations of a Phone Number][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0022. Generate Parentheses :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0022. Generate Parentheses][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0022. Generate Parentheses][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0039. Combination Sum :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0039. Combination Sum][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0039. Combination Sum][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0040. Combination Sum II :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0040. Combination Sum II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0040. Combination Sum II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0046. Permutations :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0046. Permutations][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0046. Permutations][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0051. N Queens :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0051. N Queens][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0051. N Queens][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0052. N Queens II :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0052. N Queens II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0052. N Queens II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0077. Combinations :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0077. Combinations][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0077. Combinations][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0078. Subsets :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0078. Subsets][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0078. Subsets][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0079. Word Search :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0079. Word Search][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0079. Word Search][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0090. Subsets II :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0090. Subsets II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0090. Subsets II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0131. Palindrome Partitioning :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0131. Palindrome Partitioning][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0351. Android Unlock Patterns :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0351. Android Unlock Patterns][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1079. Letter Tile Possibilities :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1079. Letter Tile Possibilities][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1863. Sum of All Subsets XOR Total :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1863. Sum of All Subsets XOR Total][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0004. Median of Two Sorted Arrays :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0004. Median of Two Sorted Arrays][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0033. Search In Rotated Sorted Array :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0033. Search In Rotated Sorted Array][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0074. Search a 2D Matrix :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0074. Search a 2D Matrix][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0153. Find Minimum In Rotated Sorted Array :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0153. Find Minimum In Rotated Sorted Array][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0704. Binary Search :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0704. Binary Search][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0704. Binary Search][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0719. Find K-th Smallest Pair Distance :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0719. Find K-th Smallest Pair Distance][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0875. Koko Eating Bananas :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0981. Time Based Key Value Store :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0981. Time Based Key Value Store][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2300. Successful Pairs of Spells and Potions :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2300. Successful Pairs of Spells and Potions][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0007. Reverse Integer :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0007. Reverse Integer][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0007. Reverse Integer][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0136. Single Number :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0136. Single Number][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0136. Single Number][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0190. Reverse Bits :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0190. Reverse Bits][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0190. Reverse Bits][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0191. Number of 1 Bits :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0191. Number of 1 Bits][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0191. Number of 1 Bits][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0231. Power of Two :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0231. Power of Two][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0231. Power of Two][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0260. Single Number III :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0260. Single Number III][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0260. Single Number III][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0268. Missing Number :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0268. Missing Number][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0268. Missing Number][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0338. Counting Bits :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0338. Counting Bits][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0338. Counting Bits][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0371. Sum of Two Integers :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0371. Sum of Two Integers][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0371. Sum of Two Integers][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2220. Minimum Bit Flips to Convert Number :easy:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2220. Minimum Bit Flips to Convert Number][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0127. Word Ladder :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0127. Word Ladder][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0127. Word Ladder][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0130. Surrounded Regions :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0130. Surrounded Regions][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0130. Surrounded Regions][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0133. Clone Graph :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0133. Clone Graph][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0133. Clone Graph][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0200. Number of Islands :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0200. Number of Islands][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0200. Number of Islands][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0207. Course Schedule :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0207. Course Schedule][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0207. Course Schedule][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0210. Course Schedule II :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0210. Course Schedule II][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0210. Course Schedule II][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0261. Graph Valid Tree :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0261. Graph Valid Tree][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0261. Graph Valid Tree][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0286. Walls And Gates :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0286. Walls And Gates][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0286. Walls And Gates][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0323. Number of Connected Components In An Undirected Graph :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0323. Number of Connected Components In An Undirected Graph][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0417. Pacific Atlantic Water Flow :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0417. Pacific Atlantic Water Flow][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0684. Redundant Connection :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0684. Redundant Connection][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0684. Redundant Connection][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0695. Max Area of Island :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0695. Max Area of Island][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0695. Max Area of Island][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0802. Find Eventual Safe States :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0802. Find Eventual Safe States][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 0994. Rotting Oranges :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*0994. Rotting Oranges][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0994. Rotting Oranges][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 1905. Count Sub Islands :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*1905. Count Sub Islands][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*1905. Count Sub Islands][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2092. Find All People With Secret :hard:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2092. Find All People With Secret][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2092. Find All People With Secret][Roadmap]]
 :END:
 ** TODO Approach
@@ -1,7 +1,7 @@
 * TODO 2658. Maximum Number of Fish in a Grid :medium:
 #+PROPERTY: STUDY_DECK_02
 :PROPERTIES:
-:NEETCODE: [[../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*2658. Maximum Number of Fish in a Grid][Roadmap]]
 :END:
 ** TODO Approach
--- a/Show More
+++ b/Show More