## Minimum flips required in a binary string such that all K-size substring contains 1

Given a binary string str of size N and a positive integer K, the task is to find the minimum number of flips required to… 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 string str of size N and a positive integer K, the task is to find the minimum number of flips required to… Read More »

Given an array of integers, we need to print k most frequent elements. If there is a tie, we need to prefer the elements whose… Read More »

Given an integer matrix mat [ ][ ] dimensions, the task is to find the largest possible square matrix from the given matrix with maximum… Read More »

Given a binary matrix mat[][] of size NxM and two integers X and Y, the task is to find the minimum number steps required to… Read More »

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

Given a matrix A[][] consisting of coordinates of N rectangles such that {A[i][0], A[i][1]} representing bottom left coordinate of rectangle and {A[i][2], A[i][3]} representing top… Read More »

Given two integer N and K, the task is to find the size of the smallest string that contains all permutations of length N that can… Read More »

Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length… Read More »

Given a large number in form of string str of size N, the task is to count the subsequence of length 4 whose digit are… Read More »

Given two strings S and T and a number K, the task is to count the number of ways to convert string S to string… Read More »

Given a string str of lowercase English alphabets, our task is to find the frequency of occurrence a subsequence of the string which occurs the… Read More »

Given an unsorted array arr[] of N integers that are in Arithmetic Progression, the task is to print the missing element from the given series.… Read More »

Given an array arr[] of N integers of value from 0 to N, the task is to count the number of components in Index Array.… Read More »

Given a string str and an integer K, the task is to find the length of the longest sub-string S such that every character in… Read More »

Given Bitwise AND, OR, and XOR of N elements of an array denoted by a, b, c. The task is to find the elements of… Read More »