feat: populate note files with problem descriptions and code stubs

Add populate-notes.mjs that fetches problem descriptions and
Python/C++ code stubs from LeetCode's GraphQL API. Populated
all 197 NeetCode 150 note files with:
- Problem description (examples, constraints)
- Python code stub (function signature)
- C++ code stub (function signature + includes)

API responses cached in leetcode/.cache/leetcode/ for instant re-runs.

org/study_deck_02/dsa/2-d-dynamic-programming/0072-edit-distance.org

@@ -1,18 +1,68 @@
 #+PROPERTY: STUDY_DECK_02
 * TODO 0072. Edit Distance :medium:
 :PROPERTIES:
-:NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0072. Edit Distance][0072. Edit Distance]]
 :END:
 
+Given two strings ~word1~ and ~word2~, return /the minimum number of operations required to convert ~word1~ to ~word2~/.
+
+You have the following three operations permitted on a word:
+
+ - Insert a character
+
+ - Delete a character
+
+ - Replace a character
+
+*Example 1:*
+
+
+#+begin_src
+Input: word1 = "horse", word2 = "ros"
+Output: 3
+Explanation: 
+horse -> rorse (replace 'h' with 'r')
+rorse -> rose (remove 'r')
+rose -> ros (remove 'e')
+#+end_src
+
+
+*Example 2:*
+
+
+#+begin_src
+Input: word1 = "intention", word2 = "execution"
+Output: 5
+Explanation: 
+intention -> inention (remove 't')
+inention -> enention (replace 'i' with 'e')
+enention -> exention (replace 'n' with 'x')
+exention -> exection (replace 'n' with 'c')
+exection -> execution (insert 'u')
+#+end_src
+
+
+*Constraints:*
+
+ - ~0 <= word1.length, word2.length <= 500~
+
+ - ~word1~ and ~word2~ consist of lowercase English letters.
+
 ** TODO Approach
 Write your approach here.
 
 ** TODO Python
 #+begin_src python
-
+class Solution:
+    def minDistance(self, word1: str, word2: str) -> int:
 #+end_src
 
 ** TODO C++
 #+begin_src cpp
-
+class Solution {
+public:
+    int minDistance(string word1, string word2) {
+        
+    }
+};
 #+end_src