Data structures and algorithms
You need prefix sums with point updates on a large array. Fenwick tree or segment tree?
AdvancedMultiple choice
- AFenwick: same bounds with a fraction of the memory and constant factor
- BSegment tree, because Fenwick trees cannot do point updates
- CSegment tree, because it has better asymptotic complexity
- DNeither: use a prefix-sum array and rebuild after each update
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Of the kind reported at
More data structures and algorithms questions
- A balanced binary search tree holds one million keys.Foundation · Premium
- What is the height (edges on the longest root-to-leaf path) of a binary heap…Foundation · Premium
- How many structurally different binary search trees can hold the keys 1,2,3,4,5?Applied · Premium
- You need the 100 largest values from a stream of 10⁹ numbers you cannot store.Foundation · Free solution
- What does the recurrence T(n) = 2T(n/2)+O(n) solve to?Applied · Free solution
- A graph has edges A–B (weight 1), B–C (2), A–C (3), C–D (4) and B–D (5).Applied · Premium