Tag archive

#range-query

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

3 articles

Mo's Algorithm: Offline Range Queries

Mo's Algorithm Mo's Algorithm is a powerful offline technique used to solve range query problems. It is particularly effective when the query results can be updated incrementally as we shift the query boundaries [L, R] t…

Apr 20, 20262 min read

Deep Dive

#dsa#java#mo-algorithm

DSAIntermediate

Segment Tree Data Structure: Efficient Range Queries

Segment Tree Data Structure A Segment Tree is a versatile data structure used to perform range queries and updates efficiently. It allows us to process operations like Range Sum Query or Range Minimum/Maximum Query in $O…

Apr 20, 20262 min read

Deep Dive

#dsa#java#segment-tree

DSAIntermediate

Fenwick Trees (Binary Indexed Trees) in Java

The Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a compact data structure that provides efficient methods for calculation and manipulation of the prefix sums of an array of values. It is more space-efficie…

Apr 19, 20263 min read

Deep Dive

#dsa#java#fenwick tree