Which optimized advanced data structure pattern solves this lesson cleanly?
Practice this question from Fenwick Tree - Binary Indexed Prefix Sum Pattern Practice Quiz, with options and an explanation.
Question
Which optimized advanced data structure pattern solves this lesson cleanly?
Option A — Correct answer
Fenwick tree using lowest-set-bit jumps.
Option B
Plain nested loops without structure
Option C
Greedy interval sorting only
Option D
Modulo arithmetic only
Explanation
Fenwick tree using lowest-set-bit jumps.