tomatocream/cpp-flashcards
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source 
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.
This commit is contained in:
Wong Ding Feng
2026-06-01 17:06:27 +08:00
parent a50f4a121b
commit d674451070
203 changed files with 401 additions and 401 deletions
Download Patch File Download Diff File Expand all files Collapse all files
org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0091-decode-ways.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0139-word-break.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0152-maximum-product-subarray.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0213-house-robber-ii.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0300-longest-increasing-subsequence.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0322-coin-change.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0647-palindromic-substrings.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0656-coin-path.org
+1 -1
View File
@@ -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
org/study_deck_02/dsa/1-d-dynamic-programming/0746-min-cost-climbing-stairs.org
+1 -1
View File
@@ -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