Skip to main content
🔒 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 PrepModule 4 · Dynamic Programming & Heap›Fenwick / Binary Indexed Treewrite54 / 104
+150 XP
Task
📝 **Question:** Build BIT for n=5 by updating each index with [3,2,-1,6,5]. Query range_sum(2, 4) (=2 + -1 + 6 = 7). Print it. 📋 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.
📊 Result
Press Run to see result...