3 articles
Master Segment Trees and Binary Indexed Trees for FAANG interviews: range sum, min, max queries, point updates, lazy propagation, 2D BIT, and full problem index with complexity reference.
LC 307 Range Sum Query Mutable is the canonical benchmark for range query data structures. BIT solves it in O(log n) per operation; Segment Tree generalizes to any associative query. Master both before your next FAANG interview.
Complete Segment Tree and Fenwick Tree cheatsheet for FAANG interviews: BIT template, segment tree template, lazy propagation, 2D BIT, decision guide, and full problem index.