Given a string s, the task is to print all permutations of a string that are in ascending order, i.e., their characters are in ascending order. Examples: Input: Cplusplus Output: Cllppssuu Out of all the permutations of the string Cllppssuu is the only string which is sorted. Input: cba Output: abc RECOMMENDED: Characteristics or features of an Algorithm… Read More »
Given a string S of size N, the task is to sort the string without changing the place of vowels. Examples: Input: S = “example” Output: elampxe Explanation: The consonants are xmpl. After sorting it becomes lmpx. Now update the string after replacing each consonants with sorted consonants. Input: S = “Cplusplus” Output: Clluppsus Recommended: Selection Sort Approach:… Read More »
Given a binary string consisting of ‘0’ & ‘1’. You can remove any subsequence in given string but can’t pick adjacent indices. Print “POSSIBLE” if string can be sorted else print “NOTPOSSIBLE”. Examples: Input: 110 Output: POSSIBLE Explanation: If we remove characters at index 1 & 3 we are left with “1” which is sorted. Input: 101001111 Output:… Read More »
You are given n strings. You have to print them in lexicographical increasing order. Also, ensure that all of the strings should be distinct. Examples: Input: {“Aarav”, “Arjun”, “Rahul”, “Rishabh”, “Kunal”} Output: {“Aarav”, “Arjun”, “Kunal”, “Rahul”, “Rishabh”} Input: {“Vikram”, “Rajat”, “Abhishek”, “Suresh”, “Rajat”} Output: {“Abhishek”, “Rajat”, “Suresh”, “Vikram”} Recommended: What is Algorithm | Introduction to Algorithms Approach: Actually… Read More »
Given an array arr[] of N dates in the form of “dd-mm-yyyy”, the task is to sort these dates in ascending order. Examples: Input: arr[] = { “25-08-1996”, “03-08-1970”, “09-04-1994” } Output: 03-08-1970 09-04-1994 25-08-1996 Input: arr[] = { “14-02-1972”, “01-01-2001”} Output: 14-02-1972 01-01-2001 A simple solution that comes to our mind is to delete all ‘-‘ from… Read More »
Given an array arr[] of N strings, the task is to sort these strings according to the numbers of matches required to represent them. Examples: Input: arr[] = { “123”, “46”, “8”, “88” } Output: 8 46 123 88 8 -> 7 sticks 46 -> 10 sticks 123 -> 12 sticks 88 -> 14 sticks Input: arr[] =… Read More »
You are given two strings string1 and string2. Your task is to find length of longest consecutive occurrences of second string that occurs in first string. Examples: Input: string1=”AAACBBAAAA”, string2=”A” Output: 4 Explanation: We will get AAA(0:3) and then AAAA(6:10) as 4 is greater than 3, answer is 4. Input: string1=”ABBABBABBAAAA”, string2=”ABB” Output: 9 Approach: Initially find length… Read More »
Given a string S, the task is to sort odd indices in ascending order and even indices in descending order of the string. Examples: Input: S = “Cplusplus” Output: Cululspsp Explanation: Sort string S in ascending order: S = “Cululspsp” Replace odd indices in ascensing order and even indices in descending order. Input: S = “plusplus” Output: lulupsps… Read More »
You are given a string s consisting only of characters ‘a’ and ‘b’. You can delete any number of characters in s to make s balanced. s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = ‘b’ and s[j]= ‘a’. Return the minimum number of deletions needed to make… Read More »
Given two strings string1 and string2, the task is to find the smallest substring in string1 containing all characters of string2. Examples : Input: string = “Cplusplus is the best”, pattern = “pp” Output: Smallest window is : plusp Explanation: “plusp” contains all the characters of pattern. Input: string = “Cplusplus”, pattern = “Cpp” Output: Smallest window is… Read More »