Count of substrings formed using a given set of characters only
Given a string str and an array arr[] of K characters, the task is to find the number of substrings of str that contains characters… Read More »
Given a string str and an array arr[] of K characters, the task is to find the number of substrings of str that contains characters… Read More »
Given an array A[] of n odd integers and an integer X. Calculate the minimum number of operations required to make the median of the… Read More »
Given an array arr[] of N pairs of integers (A, B) where N is even, the task is to find the minimum sum of choosing… Read More »
Given a 2D grid of size N x M. The task is to find the final direction after visiting every cell under given conditions. You… Read More »
Given string str, the task is to check if characters at the odd indexes of str form a palindrome string or not. If not then… Read More »
Given a number N and a digit K (1 < K <= 9), the task is to find two integers A and B such that… Read More »
Given two arrays X[] and Y[] of positive integers, find the number of pairs such that x^y > y^x where x is an element from… Read More »
Given a string str of lowercase alphabets, the task is to remove minimum characters from the given string so that string can be break into… Read More »
Best fit algorithm for memory management: The memory partition in which there is a minimum loss on the allocation of the process is the best-fit… Read More »
Given an array arr[] of size N, the task is to find the number of times the array can be partitioned repetitively into two subarrays… Read More »
Given a number N and an integer S, the task is to create an array of N integers such that sum of all elements equals… Read More »
Given a grid of size N*M consists of 0 and 1 only, the task is to find the length of longest connected 1s in the… Read More »
Given an array arr[] of N positive integers. We have to perform one operation on every odd element in the given array i.e., multiply every… Read More »
Given an array A[] consisting of N positive integers, the task is to find the maximum possible value of: F(M) = M % A[0] +… Read More »
Given two arrays A[] and B[] of N positive integers and a cost C. We can choose any one element from each index of the… Read More »