# Category Archives: Advanced Data Structure

Consider a situation where we have a set of intervals and we need following operations to be implemented efficiently:  Add an interval Remove an interval… Read More
What is String-Hashing?  String hashing is the way to convert a string into an integer known as a hash of that string.An ideal hashing is… Read More
Every beginner computer science student would have once wondered why do we find shortest path in graph or what is the use of trees, are… Read More
Given a number in form of string str and an integer K, the task is to find the smallest integer that can be formed after… Read More
Given binary string str, the task is to check whether the given string follows the below condition or not:   String starts with a ‘1’. Each… Read More
Given an array arr[] of size N and a matrix Q consisting of queries of the following two types:  1 L R : Print the… Read More
Prerequisites: Policy based data structure, Sliding window technique.Given an array of integer arr[] and an integer K, the task is to find the median of… Read More
Prerequisites: Graham Scan’s Convex Hull, Orientation.Given a set of N points in a coordinates plane, the task is to find the maximum distance between any… Read More
Given a string S of length N, and Q queries of the following type: Type 1: 1 i X Update the i-th character of the… Read More
Given an array arr[] of N numbers. We can merge two adjacent numbers into one and the cost of merging the two numbers is equal… Read More
Given a graph and two nodes u and v, the task is to print the shortest path between u and v using the Floyd Warshall… Read More
Given two N-ary trees having M nodes each. Also, given their edges and their roots respectively. The task is to check if they are isomorphic… Read More
Given a non-cyclic graph having V nodes and E edges and a source node S, the task is to calculate the sum of the minimum… Read More
Given an array arr[] of size N and Q queries of the form [L, R], the task is to find the number of distinct values… Read More
Binary Space Partitioning is implemented for recursively subdividing a space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise… Read More