Segment tree: range sum + point update

← Courses›Interview PrepModule 4 · Dynamic Programming & Heap›Segment tree: range sum + point updatewrite51 / 100

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.

Keep going

🎯write

Fenwick / Binary Indexed Tree

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion