Minimum size substring to be removed to make a given string palindromic
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, the task is to print the string after removing the minimum size substring such that S is a palindrome or not.… Read More »
Given three integers A, L, and R, the task is to count numbers from a range L to R which contains A as its suffix.… Read More »
Given an integer array arr[], the task is to split the given array into two subarrays such that the difference between their sum is minimum.… Read More »
Given two positive integers N and M, the task is to find the count of all possible numbers in the range [1, M], having suffix… 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 arr[] of size N and an integer k, our task is to find the length of longest subarray whose sum of elements… Read More »
Given a binary array arr[], the task is to find the longest subarray of non-empty cells after the removal of at most 1 empty cell. … Read More »
Given a string S of size N, the task is to count the occurrences of all the prefixes of the given string S. Examples: Input:… Read More »
Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with a given string str or not. Print… 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 set of strings S and a string P, the task is to print all strings from the set with suffix P. Examples: Input:… Read More »
Given an array arr[], the task is to find the sum of decomposition value of the suffixes subarray. Decomposition Value: Decomposition value of a subarray… Read More »
Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with “001” or not. Print “Yes” if… Read More »
Given an array arr[] of length N, the task is to check if it can be formed by merging two permutations of same or different… Read More »
Given a string S and two integer N and K, the task is to find the maximum length suffix such that occurrence of each character… Read More »