← Amazon questions

Efficient data structure for range updates and point queries

Filed under Amazon

Find an efficient data structure to support range updates (add a value x to array elements from index l to r) and point queries (retrieve the current value of a specified element arr[i]) on an array.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.