5 QUESTIONS
Q1 1 / 5 medium
Binary Indexed Tree (Fenwick Tree)
Given an array of n integers, support two operations efficiently: (1) update a single element, (2) query the prefix sum up to index i.
What is the key data structure and how does it work?