Queries to count minimum flips required to fill a binary submatrix with 0s only
Given a binary matrix mat[][] of size M * N and Q queries of the form {pi, pj, qi, qj}, the task for each query… Read More »
Given a binary matrix mat[][] of size M * N and Q queries of the form {pi, pj, qi, qj}, the task for each query… Read More »
Given an array arr[] consisting of N integers, the task is to count ways to split array into two subarrays of equal sum by changing… Read More »
Given an array, arr[] of size N, the task is to count the number of ways to split given array elements into two subarrays such… Read More »
Given a string str, consisting of lowercase alphabets, the task is to find the shortest string which is not a subsequence of the given string.… Read More »
Given an array arr[] consisting of N integers, the task is to find the maximum index K such that the product of subarrays {arr[0], arr[K]}… Read More »
Given an array of strings arr[] consisting of N unique directories in the form of strings, the task is to remove all the subdirectories and… Read More »
Given an array arr[] consisting of N integers, the task is to find the minimum length of the prefix needed to be deleted such that… Read More »
Given a circular array arr[] of N integers and an integer K, the task is to print the array after the following operations: If K… Read More »
Given a string S, the task is to print the string after removing the minimum size substring such that S is a palindrome or not.… Read More »
Given a string S of length N and integer K, find the smallest length string which contains the string S as a sub string exactly… Read More »
Given an array of strings arr[] of size N, the task is to sort the array of strings in lexicographical order and if while sorting… Read More »
Given a string S with lowercase alphabets only and Q queries where each query contains a pair {L, R}. For each query {L, R}, there… Read More »
Given an array arr[] consisting of N integers, the task is to find the array K[] of minimum possible length such that after performing multiple… Read More »
Given two string S and T, the task is to find the minimum length prefix from S which consists of all characters of string T.… Read More »
Given two numbers A and B where (A > B), the task is to check if B is a prefix of A or not. Print… Read More »