🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
← Courses›Interview Prep›Module 4 · Dynamic Programming & Heap›Binary search on answer: Koko bananaswrite62 / 104
+125 XP
Task
📝 **Question:** Implement `min_eating(piles, H)` using binary search on the answer. Test on (piles=[3,6,7,11], H=8) → 4.
📋 Pick the right answer.
💡 **Hint:** Re-read the theory above if unsure.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.