Segment-Tree

156+ posts

Last Updated: 15 July 2026

Given an array arr[] of integers, for each element arr[i], find the smallest element arr[j] such that j i and arr[j] arr[i]. If no such element exists, return -1 for tha...read more

Persistent Segment Tree in Python

Last Updated: 23 July 2025

Persistent data structures are a powerful tool in computer science, enabling us to maintain and access multiple versions of a data structure over time. One such structure ...read more

Range Minimum Query (RMQ) in Python

Last Updated: 23 July 2025

Range Minimum Query (RMQ) problem involves finding the minimum value within a specified range of a given array. This problem is used in various fields such as computer sci...read more

Lazy Propagation in Python

Last Updated: 23 July 2025

Segment tree is the data structure that can be used for solving the range queries efficiently. In Segment tree, a single value update in array may cause multiple updates i...read more

Advanced Data Structure

Last Updated: 21 January 2026

Segment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range q...read more

Range Minimum Query with Range Assignment

Last Updated: 23 July 2025

There is an array of n elements, initially filled with zeros. The task is to perform q queries from given queries[][] and there are two types of queries:Type 1 (i.e querie...read more

Picked

DSA

Segment-Tree

Geeks Premier League 2023

Segment Tree for Range Assignment and Range Sum Queries

Last Updated: 02 January 2026

Given an array of size N filled with all 0s, the task is to answer Q queries, where the queries can be one of the two types:Type 1 (1, L, R, X): Assign value X to all elem...read more

Geeks Premier League 2023

Segment Tree for Range Addition and Range Minimum Query

Last Updated: 23 July 2025

Given an array of size N initially filled with 0s. There are Q queries to be performed, and each query can be one of two types:Type 1 (1, L, R, X): Add X to all elements i...read more

Picked

DSA

Segment-Tree

Geeks Premier League 2023

Segment Tree for Range Multiplication and Sum Queries

Last Updated: 23 July 2025

Given an array of size N filled with all 1s, the task is to answer Q queries, where the queries can be one of the two types: Type 1 (1, L, R, X): Multiply all elements on ...read more

Geeks Premier League 2023

Segment Tree for Range Bitwise OR and Range Minimum Queries

Last Updated: 07 March 2024

There is an array of n elements, initially filled with zeros. The task is to perform q queries from given queries[][] and there are two types of queries, type 1 queries in...read more

Picked

DSA

Segment-Tree

Geeks Premier League 2023

Range Operations and Lazy Propagation for Competitive Programming

Last Updated: 23 July 2025

In competitive programming, mastering range operations and understanding lazy propagation techniques is a crucial skill set for efficiently handling complex problems invol...read more

Algorithms-Graph Traversals

Python numpy-Random

Segment Trees for Competitive Programming

Last Updated: 23 July 2025

Segment Tree is one of the most important data structures used for solving problems based on range queries and updates. Problems based on Segment Trees are very common in ...read more

DSA

array-range-queries

Segment-Tree

Increasing Decreasing Update Queries (Akku and Arrays)

Last Updated: 23 July 2025

Akku has solved many problems, she is a genius. One day her friend gave her an Array of sizes n and asked her to perform some queries of the following type:Each query cons...read more

DSA

Segment-Tree

Geeks Premier League 2023

Partitions in Arrays with at least K-Size and M-Difference Rules (Array Partition)

Last Updated: 23 July 2025

Given an array A[] of N integers, find if it is possible to partition the array with following rules:Each element should belong to exactly one partition.Each partition sho...read more

DSA

Segment-Tree

Geeks Premier League 2023

Comparison between Fenwick Tree vs Segment Tree - with Similarities and Differences

Last Updated: 24 November 2025

Fenwick Tree (Binary Indexed Tree) and Segment Tree are both data structures used for efficient range query and update operations on an array. Here's a tabular comparison ...read more

1 2 3 4

...