# Category Archives: Advanced Data Structure

Link Cut Trees (LCT) is a data structure that allows for efficient dynamic maintenance of trees. It is a type of self-adjusting data structure thatâ€¦ Read More
A Li Chao tree (also known as a Dynamic Convex Hull or Segment Tree with lazy propagations) is a data structure that allows for efficientâ€¦ Read More
Given a 2D array arr[][] of size N * M, the value in arr[][] represents the value of coins, the task is to maximize theâ€¦ Read More
Trie data structure is defined as a Tree based data structure that is used for storing some collection of strings and performing efficient search operationsâ€¦ Read More
Dynamic connectivity, in general, refers to the storage of the connectivity of the components of a graph, where the edges change between some or allâ€¦ Read More
Given an N-ary tree consisting of N nodes with values from 1 to N rooted at 1, for all nodes, print the number of ancestorsâ€¦ Read More
Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than allâ€¦ Read More
Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than allâ€¦ Read More
Given an array A[] of length N, where N is an even number, the task is to answer Q independent queries where each query consistsâ€¦ Read More
Given an array A[] of length N, where N is an even number, the task is to answer Q independent queries where each query consistsâ€¦ Read More
Given an array A[] of length N, where N is an even number, the task is to answer Q independent queries where each query consistsâ€¦ Read More
Given an array A[] of length N, where N is an even number, the task is to answer Q independent queries where each query consistsâ€¦ Read More
In this article, we will see how to create a data structure that can handle multiple stacks with growable size. The data structure needs toâ€¦ Read More
Given an array of integers, evaluate queries of the form LCM(l, r). There might be many queries, hence evaluate the queries efficiently.Â Â  LCM (l, r)â€¦ Read More
Given an array of integers, evaluate queries of the form LCM(l, r). There might be many queries, hence evaluate the queries efficiently.Â Â  LCM (l, r)â€¦ Read More