#01··8 min read·Segment Trees
Segment Tree: Range Updates with Lazy Propagation
Mastering interval queries and range modifications in O(log N) using delayed push-down evaluation in Segment Trees for competitive programming.
back to all articles
Curated Learning Track
Data Structures & Algorithms
A progressive, chronologically ordered series of 4 in-depth essays and architectural breakdowns. Read from top to bottom to follow the original conceptual narrative.
Arranged in chronological order of publication (Foundations → Advanced)
#02··7 min read·DSA & Algorithms
Segment Tree: Introduction
This article covers about the basics of segment tree
#03··4 min read·DSA & Algorithms
Segment Tree: Range update with lazy propagation
When moving from a normal segment tree to a lazy segment tree, the main goal is to support efficient range updates. In a standard segment tree, updating a…
#04··12 min read·DSA & Algorithms
Segment Tree: Handling Large Constraints with Coordinate Compression
I encountered the next challenge in the CSES problem set: Salary Queries, a problem rich with concepts and learning opportunities.