🔒 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›Segment tree: range sum + point updatewrite53 / 104
+175 XP
Task
📝 **Question:** Build segment tree from [1,2,3,4,5]. Query sum [1..3] (=2+3+4=9). Update index 2 to 10. Query [1..3] again (=2+10+4=16). Print both.
📋 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.