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/binary-search/0875-koko-eating-bananas.org

@@ -1,18 +1,67 @@
 #+PROPERTY: STUDY_DECK_02
 * TODO 0875. Koko Eating Bananas :medium:
 :PROPERTIES:
-:NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][Roadmap]]
+:NEETCODE: [[file:../../roadmap.org::*0875. Koko Eating Bananas][0875. Koko Eating Bananas]]
 :END:
 
+Koko loves to eat bananas. There are ~n~ piles of bananas, the ~i^{th}~ pile has ~piles[i]~ bananas. The guards have gone and will come back in ~h~ hours.
+
+Koko can decide her bananas-per-hour eating speed of ~k~. Each hour, she chooses some pile of bananas and eats ~k~ bananas from that pile. If the pile has less than ~k~ bananas, she eats all of them instead and will not eat any more bananas during this hour.
+
+Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return.
+
+Return /the minimum integer/ ~k~ /such that she can eat all the bananas within/ ~h~ /hours/.
+
+*Example 1:*
+
+
+#+begin_src
+Input: piles = [3,6,7,11], h = 8
+Output: 4
+#+end_src
+
+
+*Example 2:*
+
+
+#+begin_src
+Input: piles = [30,11,23,4,20], h = 5
+Output: 30
+#+end_src
+
+
+*Example 3:*
+
+
+#+begin_src
+Input: piles = [30,11,23,4,20], h = 6
+Output: 23
+#+end_src
+
+
+*Constraints:*
+
+ - ~1 <= piles.length <= 10^{4}~
+
+ - ~piles.length <= h <= 10^{9}~
+
+ - ~1 <= piles[i] <= 10^{9}~
+
 ** TODO Approach
 Write your approach here.
 
 ** TODO Python
 #+begin_src python
-
+class Solution:
+    def minEatingSpeed(self, piles: List[int], h: int) -> int:
 #+end_src
 
 ** TODO C++
 #+begin_src cpp
-
+class Solution {
+public:
+    int minEatingSpeed(vector<int>& piles, int h) {
+        
+    }
+};
 #+end_src