Segment Tree

19 problems to practice.

19 Total
0 Easy
10 Medium
9 Hard

Max In An Interval - Range Query

You are given an array(of integers) of length n. You are required to answer q queries. In each que...

medium

Sum Of Interval

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

medium

Max In A Interval - Range Query Point Update

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

medium

What's At Idx - Point Query Range Update

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

medium

Sum Of Range - Range Query Range Update

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

medium

Maximum Sum

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

medium

Sum Of Squares

You are given an array(of integers) of length n. You are required to answer q queries. Queries c...

hard

2d Segment Tree

Mr. Pepcoder has a 2D Array, and his Friend love to do operations on thearray. The operations can be...

hard

Toggle Bulbs

You are given n bulbs, numbered from 1 to n. Initially all the bulbs are turned off. You have to pe...

medium

Prime Divide

You are given an array A of N numbers. You need to perform Q operations. Each operation has one of...

medium

Multiples Of 3

There are N numbers(indexed from 1 to N) initially all are 0. You have to perform Q operations of t...

medium

K Increasing Subsequence 1

For the given sequence A with n different elements find the number of increasing subsequences with k...

medium

K Increasing Subsequence 2

For the given sequence A with n elements find the number of strictly increasing subsequences with k...

hard

Domino Principle

<a href="https://codeforces.com/contest/56/problem/E">https://codeforces.com/contest/56/proble...

hard

Xor On Segment

<a href="https://codeforces.com/contest/242/problem/E">https://codeforces.com/contest/242/pro...

hard

Interesting Array

<a href="https://codeforces.com/contest/482/problem/B">https://codeforces.com/contest/482/prob...

hard

Complex Queries

You are given a sequence of whole numbers {0,1,2,3 ... , N-1} defined in an array A. where A[i] = i...

hard

Persistent Segment Tree

<a href="https://www.spoj.com/problems/MKTHNUM/">https://www.spoj.com/problems/MKTHNUM/</a&...

hard

Kquery

<a href="https://www.spoj.com/problems/KQUERY/">https://www.spoj.com/problems/KQUERY/</a&gt...

hard