Binary Index Tree, Trie, and KMP
Part 1 - Binary Index Tree
query
, sum all nodes fromidx + 1
to0
, usinggetParent
update
, add diff to nodes fromidx + 1
toarr.size
, usinggetNext
- Youtube Tutorial and Java Implementation
Part 2 - Trie
- Article labuladong trie