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/stack/0739-daily-temperatures.org

@@ -1,18 +1,55 @@
 #+PROPERTY: STUDY_DECK_02
 * TODO 0739. Daily Temperatures :medium:
 :PROPERTIES:
-:NEETCODE: [[file:../../roadmap.org::*0739. Daily Temperatures][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0739. Daily Temperatures][0739. Daily Temperatures]]
 :END:
 
+Given an array of integers ~temperatures~ represents the daily temperatures, return /an array/ ~answer~ /such that/ ~answer[i]~ /is the number of days you have to wait after the/ ~i^{th}~ /day to get a warmer temperature/. If there is no future day for which this is possible, keep ~answer[i] == 0~ instead.
+
+*Example 1:*
+
+
+#+begin_src
+Input: temperatures = [73,74,75,71,69,72,76,73]
+Output: [1,1,4,2,1,1,0,0]
+#+end_src
+*Example 2:*
+
+
+#+begin_src
+Input: temperatures = [30,40,50,60]
+Output: [1,1,1,0]
+#+end_src
+*Example 3:*
+
+
+#+begin_src
+Input: temperatures = [30,60,90]
+Output: [1,1,0]
+#+end_src
+
+
+*Constraints:*
+
+ - ~1 <= temperatures.length <= 10^{5}~
+
+ - ~30 <= temperatures[i] <= 100~
+
 ** TODO Approach
 Write your approach here.
 
 ** TODO Python
 #+begin_src python
-
+class Solution:
+    def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
 #+end_src
 
 ** TODO C++
 #+begin_src cpp
-
+class Solution {
+public:
+    vector<int> dailyTemperatures(vector<int>& temperatures) {
+        
+    }
+};
 #+end_src