## Replace every vowels with lexicographically next vowel in a String

Given a string str of size N, which contains lowercase English alphabets. The task is to replace each vowel with the next immediate vowel lexicographically,… Read More »

- Sort a string according to the frequency of characters
- Count of same length Strings that exists lexicographically in between two given Strings
- Smallest Palindromic Subsequence of Even Length in Range [L, R]
- Largest lexicographical string with at most K consecutive elements
- Lexicographically all Shortest Palindromic Substrings from a given string
- Lexicographically smallest K-length substring containing maximum number of vowels
- Lexicographically smaller string by swapping at most one character pair
- Make the string lexicographically smallest and non palindromic by replacing exactly one character
- K-th lexicographical string of given length
- Find the k-th string in lexicographical order consisting of n-2 X's and 2 Y's
- Lexicographically smallest array formed by at most one swap for every pair of adjacent indices
- Sort an Array alphabetically when each number is converted into words
- Generate all numbers up to N in Lexicographical Order

Given a string str of size N, which contains lowercase English alphabets. The task is to replace each vowel with the next immediate vowel lexicographically,… Read More »

Given a string S and integer M. The task is to perform exactly M operations to get lexicographical smallest string. In each operation, select one… Read More »

Given a string consisting of the first N distinct alphabets, the task is to sort the string by using at most N/2 moves. Each move… Read More »

Given a string S, print those permutations of string S which are lexicographically greater than S. If there is no such permutation of string, print… Read More »

Given a string str of length N, the task is to obtain the lexicographically largest string by at most one swap. Note: The swapping characters… Read More »

Given two strings S1 and S2 of length N and a positive integer K, the task is to find the lexicographically smallest string such that… Read More »

Given an integer N, the task is to print all numbers up to N in Lexicographical order. Examples: Input: N = 15 Output: 1 10… Read More »

Given a string str containing only lowercase English alphabets and an integer K, the task is to find a K length substring which contains the… Read More »

Given an array A[] of length N, the task is to find lexicographically smallest array by swapping adjacent elements for each index atmost once. Thus,… Read More »

Given two integers N and K, the task is to find lexicographically Kth string of length N. If the number of possible strings of length… Read More »

Given a string S, the task is to find the largest lexicographical string with no more than K consecutive occurrence of an element by either… Read More »

Given a palindromic string str containing only lowercase letters, the task is to print the lexicographically smallest string, by replacing exactly one character, such the… Read More »

Given two numbers N and K, the task is to find the Kth string in lexicographical order if the starting string contains (N-2) x’s first… Read More »

Given an array arr[] containing N non-negative integers, the task is to sort these integers alphabetically when each number is converted into words. Examples: Input:… Read More »

Given a string s of size N. The task is to find lexicographically all shortest palindromic substrings from the given string. Examples: Input: s= “programming”… Read More »