Segment-Tree

Huawei

Uber

TCS-coding-questions

Introduction to Segment Trees - Data Structure and Algorithm Tutorials

Last Updated: 14 December 2024

A Segment Tree is used to stores information about array intervals in its nodes.It allows efficient range queries over array intervals.Along...read more

Segment tree | Efficient implementation

Last Updated: 20 January 2025

Let us consider the following problem to understand Segment Trees without recursion.We have an array arr[0 . . . n-1]. We should be able to,...read more

Queries for counts of array values in a given range

Similar Topics

DSA

22.5k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Competitive Programming

2.3k+ articles

Algorithms

2k+ articles

Tree

1.4k+ articles

Recursion

1k+ articles

Advanced Data Structure

580+ articles

array-range-queries

360+ articles

Divide and Conquer

260+ articles

Last Updated: 20 March 2025

Given an unsorted array of integers and a set ofmqueries, where each query consists of two integersxandy, the task is to determine the numbe ...read more

Arrays

Amazon

Binary Search

Persistent Segment Tree | Set 1 (Introduction)

Last Updated: 27 January 2023

Prerequisite : Segment Tree Persistency in Data StructureSegment Tree is itself a great data structure that comes into play in...read more

How to prepare for ACM - ICPC?

Last Updated: 25 May 2023

ACM ICPC(Association for Computing Machinery - International Collegiate Programming Contest) is a worldwide annual multi-tiered programming ...read more

Min-Max Range Queries in Array

Last Updated: 14 March 2023

Given an array arr[0 . . . n-1]. We need to efficiently find the minimum and maximum value from index qs (query start) to qe (query end) whe ...read more

Overview of Graph, Trie, Segment Tree and Suffix Tree Data Structures

Last Updated: 09 February 2023

Introduction:Graph: A graph is a collection of vertices (nodes) and edges that represent relationships between the vertices. Graphs are used...read more

Trie

Suffix-Tree

Top 10 Algorithms and Data Structures for Competitive Programming

Last Updated: 10 September 2024

In this post, we will discuss Important top 10 algorithms and data structures for competitive coding.Topics :Graph algorithmsDynamic program...read more

GBlog

GBlog-Competitive-Programming

Find LCA in Binary Tree using RMQ

Last Updated: 31 July 2022

The article describes an approach to solving the problem of finding the LCA of two nodes in a tree by reducing it to an RMQ problem.The Lowe...read more

LCA

Range Minimum Query (Square Root Decomposition and Sparse Table)

Last Updated: 25 August 2023

We have an array arr[0 . . . n-1]. We should be able to efficiently find the minimum value from index L (query start) to R (query end) where...read more

Lazy Propagation in Segment Tree

Last Updated: 25 April 2023

Segment tree is introduced in previous post with an example of range sum problem. We have used the same "Sum of given Range" problem to expl...read more

Largest Rectangular Area in a Histogram using Segment Tree

Last Updated: 23 February 2023

Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. For ...read more

Segment Tree | Range Minimum Query

Last Updated: 11 February 2025

We have introduced a segment tree with a simple example in the previous post. In this post, the Range Minimum Query problem is discussed as ...read more

Segment Tree | Sum of given range

Last Updated: 09 March 2023

Let us consider the following problem to understand Segment Trees.We have an array arr[0 . . . n-1]. We should be able toFind the sum of ele...read more