## Count of ways to select K consecutive empty cells from a given Matrix

Given a binary matrix V[][] of dimensions N * M, wherein each cell is either empty or blocked marked by a 0 and 1 respectively,… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Maximum sum path in a Matrix
- Stack of Pair in C++ STL with Examples
- Set of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Count of subarrays which start and end with the same element
- Real-time application of Data Structures
- Find the string formed by joining k consecutive nodes of linked list
- Kth most frequent Character in a given String
- Program to reverse words in a given string in C++
- Implementing upper_bound() and lower_bound() for Ordered Set in C++
- Longest Mountain Subarray
- What is a Webcrawler and where is it used?
- Count the number of ways to construct the target string
- Reverse an array in groups of given size | Set 3 (Single traversal)
- Count triplets such that sum of any two number is equal to third | Set 2
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- CamelCase Pattern Matching
- Program to find frequency of each element in a vector using map in C++
- Count ways to partition a string such that both parts have equal distinct characters
- Find if there is a path between two vertices in an undirected graph
- Design a Queue data structure to get minimum or maximum in O(1) time
- Paranthesis Theorem
- Shortest path in a directed graph by Dijkstra’s algorithm
- Duplicates Removal in Array using BST
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- XOR of elements in a given range with updates using Fenwick Tree
- Maximum Possible Rating of a Coding Contest

Given a binary matrix V[][] of dimensions N * M, wherein each cell is either empty or blocked marked by a 0 and 1 respectively,… Read More »

Given a linked list where every node represents a linked list and contains two pointers of its type: Pointer to next node in the main… Read More »

Given a string str, the task is to check if it can be split into substrings such that each substring starts with a numeric value… Read More »

Given a number N, the task is to find the number of quadraples such that a2 + b2 = c2 + d2 where (1 <=… Read More »

Given an array arr[] of N positive integers and a number K, the task is to find the maximum value of bitwise OR of the… Read More »

Given a string str of size N, which contains lowercase English alphabets. The task is to replace each vowel with the next immediate vowel lexicographically,… Read More »

Given an unweighted directed graph G as a path matrix, the task is to find out if the graph is Strongly Connected or Unilaterally Connected… Read More »

Given an undirected graph having N vertices and M edges and each vertex is associated with a cost and a source vertex S is given.… Read More »

Given an array arr[] of positive integers. The task is to reverse a subarray to minimize the sum of elements at even places and print… Read More »

Given a binary tree, the task is to print the longest path from the root node to the leaf node. If there are multiple answers… Read More »

Given two numbers K and N. The task is to represent the given number K as a sum of several N-bonacci numbers. Examples: Input: K… Read More »

Given an array arr[] of size N, the task is to find the minimum possible sum by extracting the smallest element from any K subsequences… 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 two arrays A[] and B[] consisting of N positive integers and a integer M, the task is to find the minimum value of X… Read More »

Given an integer N and an arr1[], of (N – 1) integers, the task is to find the sequence arr2[] of N integers in the… Read More »