Given two string S1 and S2 of length L, the task is to count the number of strings of length L, that exists in between S1 and S2, which are lexicographically greater than S1 but smaller than S2.
Input: S1 = “b”, S2 = “f”
These are 3 strings which come lexicographically in between S1 and S2 i.e. “c”, “d” & “e”
Input: S1 = “aby”, S2 = “ace”
These are 5 strings which come lexicographically in between S1 and S2 i.e. “abz”, “aca”, “acb”, “acc” & “acd”.
- First, find out the number of strings lexicographically smaller than the first string S1, as:
Let the String S1 of length L be represented as c0c1c2...cL-1 where ci is the character in S1 at index i Therefore, To get the number of strings less than S1, we will calculate it as N(S1) = (number of letters less than c0 * 26L-1) + (number of letters less than c1 * 26L-2) + (number of letters less than c2 * 26L-3) + ... + (number of letters less than cL-2 * 26) + (number of letters less than cL-1)
Let S1 = "cbd" Number of strings less than S1 N(S1) = (number of letters less than 'c' * 262) + (number of letters less than 'b' * 26) + (number of letters less than 'd') N(S1) = (2 * 26 * 26) + (1 * 26) + (3) = 1352 + 26 + 3 = 1381.
- Similarly, find out the number of string lexicographically smaller than S2.
- Then just find out the difference between the above two values to get the number of string lexicographically greater than S1 but smaller than S2.
Below is the implementation of the above approach:
Time Complexity: In the above approach, we are looping over the two strings of length N, therefore it will take O(N) time where N is the length of each string.
Auxiliary Space Complexity: As in the above approach there is no extra space used, therefore the Auxiliary Space complexity will be O(1).
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Lexicographically smallest permutation of a string that can be reduced to length K by removing K-length prefixes from palindromic substrings of length 2K
- Count substrings of same length differing by a single character from two given strings
- Count lexicographically increasing K-length strings possible from first N alphabets
- Count N-length strings consisting only of vowels sorted lexicographically
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Check whether two strings contain same characters in same order
- Count binary strings of length same as given string after removal of substrings "01" and "00" that consists of at least one '1'
- Count of binary strings of length N having equal count of 0's and 1's and count of 1's ≥ count of 0's in each prefix substring
- Compare two strings lexicographically in Java
- Maximum count of sub-strings of length K consisting of same characters
- Lexicographically next greater string using same character set
- Meta Strings (Check if two strings can become same after a swap in one string)
- Lexicographically smallest string which differs from given strings at exactly K indices
- Loss when two items are sold at same price and same percentage profit/loss
- Count arrays of length K whose product of elements is same as that of given array
- Lexicographically Smallest Permutation of length N such that for exactly K indices, a[i] > a[i] + 1
- Lexicographically smallest string of length N and sum K
- Lexicographically smallest K-length substring containing maximum number of vowels
- Check whether two strings can be made equal by reversing substring of equal length from both strings
- Minimize replacements or swapping of same indexed characters required to make two given strings palindromic
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.