# Category Archives: Data Structures

Given a string S  of length N and an integer K. The task is to find the minimum count of distinct strings by changing at… Read More
A Max-Heap is defined as a type of Heap Data Structure in which each internal node is greater than or equal to its children.  The… Read More
Given an undirected graph with N nodes and M edges in the form of array edg[][2], the task is to count all simple paths (paths… Read More
Given a number N, the problem requires shuffling the numbers from 1 to N in a way that satisfies a condition, where the sum of… Read More
Given an array nums[] of N positive integers, the task is to find the number of subsequences that can be created from the array where… Read More
An undirected graph is a type of graph where the edges have no specified direction assigned to the them. Example of undirected graph Characteristics of… Read More
Given a string S which consists of only lowercase English alphabets, the task is to remove the first repeating character, reverse it, and repeat until… Read More
A B-Tree is a self-balancing tree data structure widely used in database and file systems for its efficiency in storing and retrieving massive quantities of… Read More
Given an array arr[], the task is to find the minimum number of elements to be removed such that every element at an even index… Read More
Given an integer N representing the number of cities near you along with two arrays pos[] representing the position of the city and time[] representing… Read More
A Min-Heap is defined as a type of Heap Data Structure in which each internal node is smaller than or equal to its children.  The… Read More
Given a string S consisting of lowercase letters. Find the longest subsequence of S such that the difference between the maximum and minimum occurring characters… Read More
Given an array A[] of size N along with W, K. We can increase W continuous elements by 1 where we are allowed to perform… Read More
Given a maze with N cells. Each cell may have multiple entry points but not more than one exit(i.e entry/exit points are unidirectional doors like… Read More
Given an array a[] of size n containing only non-negative integers, and an integer k, the task is to find the number of pairs of… Read More