>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which compact indexed structure supports point updates and prefix-sum queries in logarithmic time? | SWE Maxx
← Question bank
Data structures · Multiple Choice
Difficulty: Hard
Which compact indexed structure supports point updates and prefix-sum queries in logarithmic time?
Specialized structures
Efficient queries
Choose your answer
A
Segment tree
B
Fenwick tree
C
Bloom filter
D
Trie
Check answer
More in Data structures →