## Transform a string such that it has abcd..z as a subsequence

Given a string S of only small English letters. We need to transform the string by making some number of moves (any number of times)… Read More »

Given a string S of only small English letters. We need to transform the string by making some number of moves (any number of times)… Read More »

Given a number as string s, find the sum of all the elements present in all possible subsequences of s. Examples : Input : s… Read More »

Given a string ‘s’ and an integer k, find other string ‘t’ such that ‘t’ is the largest subsequence of given string ‘s’ and each… Read More »

Given two strings, find the length of longest uncommon subsequence of the two strings. The longest uncommon subsequence is defined as the longest subsequence of… Read More »

Given a sequence, find the length of the longest palindromic subsequence in it. More examples Input : abbaab Output : 4 Input : geeksforgeeks Output… Read More »

Given two strings str1 and str2 of length n1 and n2 respectively. The problem is to count all the subsequences of str1 which are anagrams… Read More »

Given two strings str1 and str2 of length n1 and n2 respectively. The problem is to find the length of the longest subsequence which is… Read More »

Given two strings A and B, the problem is to find if string B will be a subsequence of of string A if we remove… Read More »

Given an arr of size n. The problem is to count all the subsequences having maximum number of distinct elements. Examples: Input : arr[] =… Read More »

Given a string of length n and a subsequence of length 3. Find the total number of occurrences of the subsequence in this string. Examples:… Read More »

Given an array of size n. The problem is to find the length of the subsequence in the given array such that all the elements… Read More »

Given a string S of length n and a positive integer k. The task is to find number of Palindromic Subsequences of length k. Examples:… Read More »

Given n elements and a ratio r, find the number of G.P. subsequences with length 3. A subsequence is considered GP with length 3 with… Read More »

Given a binary array, the task is find the size of the largest sub_sequence which having equal number of zeros and one. Input : arr[]… Read More »

Given a number of at most 100 digits. We have to check if it is possible, after removing certain digits, to obtain a number of… Read More »