Segment Tree Problems

You are given an array of N integers. Then there will be Q commands of the following type: 1) Change...

• By faiyaz26
• DataStructure, MOSAlgorithm, SegmentTree
• Moderate
• 46/89 Solutions
• 707 Submissions
• uDebug

Given an array of N elements, indexed from 0 to N-1. Now you are given some queries in the form [L, ...

• By amirul_islam
• BinarySearch, SegmentTree
• Moderate
• 102/145 Solutions
• 444 Submissions

Sasuke is a 12-year old ninja who is very much interested in learning Ninjutsu (A tactic used by nin...

• By fsshakkhor
• SegmentTree
• Moderate
• 123/206 Solutions
• 1003 Submissions
• uDebug

This is another simple range query problem where you will perform some updates and answer some queri...

• By SMAN2901
• SegmentTree
• Moderate
• 67/82 Solutions
• 425 Submissions
• uDebug

A frog wants to cross a river. There are some posts in the river. The frog can go from one post to a...

• By kazi_nayeem
• SegmentTree
• Moderate
• 31/42 Solutions
• 185 Submissions

Imagine, you have an array of integers of size N. At each index of this array is a unique integer fr...

• By TarifEzaz, backbencher16
• FenwickTree, SegmentTree, Sorting
• Moderate
• 158/269 Solutions
• 706 Submissions

You are given a string of length L. You have Q queries. In each query, you will be asked to either u...

• By tahmedge, IamHot
• DataStructure, Hashing, SegmentTree
• Moderate
• 4/14 Solutions
• 52 Submissions

“Avoid touching your face, particularly your eyes, nose or mouth to prevent the virus from entering ...

• By Riaz_BSMRSTU
• DisjointSets, FenwickTree, SegmentTree
• Moderate
• 3/19 Solutions
• 50 Submissions

There are N numbers in an array. You will have Q queries. In each query, you can make 2 operations. ...

• By tahmedge
• FenwickTree, NumberTheory, SegmentTree
• Moderate
• 306/400 Solutions
• 1235 Submissions
• uDebug

An array is called “unique” if it has no consecutive element with same value(A[i] != A[i-1]). Given ...

• SegmentTree
• Moderate
• 21/34 Solutions
• 238 Submissions
• uDebug

You are given a string S (of length n) consisting of alphabets only. You need to perform m queries o...

• By emrul_mu
• DataStructure, FenwickTree, SegmentTree
• Moderate
• 90/99 Solutions
• 263 Submissions

Naruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses...

• By rohijulislam
• DataStructure, MOSAlgorithm, MergeSortTree, SegmentTree
• Moderate
• 20/35 Solutions
• 101 Submissions

Five friends A, B, C, D and E has come to a shop to buy crayons for their art project. They need cra...

• FenwickTree, MOSAlgorithm, SegmentTree
• Moderate
• 21/41 Solutions
• 149 Submissions

To end the long-running feud between Superman and Goku fans regarding who’s stronger, Zeron has deci...

• By Zeronfinity
• PersistentLiChaoTree, SegmentTree
• Moderate
• 3/4 Solutions
• 17 Submissions

Ryo and his girlfriend love to think about challenges. One day his girlfriend gave him a challenge t...

• By AnikaTahsin
• FenwickTree, NumberTheory, SegmentTree
• Moderate
• 160/178 Solutions
• 524 Submissions

On the planet of Royal Royal, a university named Royal University of Engineering and Technology exis...

• By Zeronfinity
• ChineseRemainderTheorem, SegmentTree
• Moderate

-Onions make us cry, don’t they? They can make us happy too. -How? -Read the statement carefully! S...

• By Hasinur_
• NumberTheory, SegmentTree
• Moderate
• 1/3 Solution
• 17 Submissions

The team congratulates you for participating in this contest and for being part of the journey towar...

• By Hasinur_
• NumberTheory, SegmentTree
• Moderate
• 68/97 Solutions
• 356 Submissions

No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen...

• By tanu_RUET
• BinarySearch, FenwickTree, Implementation, SegmentTree
• Moderate
• 11/37 Solutions
• 155 Submissions

You’ll be given an array A of N strings containing lowercase english letters only and Q queries. In ...

• By moshiur_cse15
• Eertree, SegmentTree
• Moderate
• 14/21 Solutions
• 141 Submissions