Skip to content

Category Archives: Advanced Data Structure

Given an array arr[] consisting of N distinct integers, the task is to count the number of triplets (i, j, k) possible from the array… Read More
The find_by_order() is a built-in function of Ordered Set which is a Policy Based Data Structure in C++. Policy-based data structures are not part of… Read More
Given an array arr[] consisting of N non-negative integers and a 2D array queries[][] consisting of queries of the type {X, M}, the task for… Read More
Given a string S of length N and a 2D array of strings Q[][] consisting of M queries of the following type: Query(“U”, “I”, “X”):… Read More
Given an Array arr[] of positive integers of size n. We are required to perform following 3 queries on given array – 1) Given L… Read More
Given a string S and an array of strings arr[] of length N and M respectively, the task is to find the string from the… Read More
Given an array arr[] consisting of N integers and a 2D array Q[][] consisting of queries of the following two types: 1 L R: Print… Read More
Given two arrays apples[] and days[] representing the count of apples an apple tree produces and the number of days these apples are edible from… Read More
Given an array arr[] consisting of N 0s and a 2D array Q[][] consisting of queries of the following two types: 1 L R X:… Read More
Ropes are scalable string implementation. They are designed for efficient operation that involves the string as a whole. Operations such as assignment, concatenation, and sub-string… Read More
Given two arrays A[] and B[] consisting of N integers and an integer K, the task is to find the maximum value of B[i] +… Read More
Prerequisite: Apriori Algorithm & Frequent Item Set Mining The number of frequent itemsets generated by the Apriori algorithm can often be very large, so it… Read More
Given a XOR linked list, the task is to pairwise swap the elements of the given XOR linked list . Examples: Input: 4 7 9… Read More