Skip to content

Category Archives: Advanced Data Structure

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
Given an XOR linked list, the task is to remove the first node of the XOR linked list. Examples: Input: XLL = 4 < –… Read More
Given an array arr[] consisting of N integers and an array Queries[] consisting of Q queries of the type {X, L, R} to perform following… Read More
A trie is a data structure that stores strings like a tree data structure. The maximum number of children in a node is equal to… Read More
Given a binary array arr[] of size N and a 2D array Q[][] containing K queries of the following two types: 1 : Print the… Read More
Given an array of strings str[] and a string key, the task is to check if the spelling of the key is correct or not.… Read More
Given an array arr[] of size N and an integer K, the task is to find the length of the longest subarray consisting of same… Read More
Given an array of strings arr[], the task is to print all unique strings that are present in the given array. Examples: Input: arr[] =… Read More
Given a string str, the task is to find the maximum count of common non-repeating characters that can be obtained by partitioning the given string… Read More