Given a string str, the task is to check if string str is a substring of an infinite length string S in which lowercase alphabets are concatenated in reverse order as:
S = “zyxwvutsrqponmlkjihgfedcbazyxwvutsrqponmlkjihgfedcba….”
Input: str = “cbaz”
Given string “cbaz” is a valid sub string of S.
Input: str = “ywxtuv”
Given string “ywxtuv” is a valid sub string of S.
Approach: It can be observed that every next character has a lower ASCII value than the previous character except when ‘a’ is followed by ‘z’. The best way to solve this problem is to simply check for every character if the character following it has a lower ASCII value. Ignore this comparison when the current character is ‘a’. If the current character ‘a’ occurred then check if it is followed by character is ‘z’.
Below are the steps:
- Create a flag variable to mark if a given string is a valid substring or not. Initially set it to true.
- Traverse the given string str, and for every character, str[i] do the following:
- If str[i+1] + 1 < str[i], continue with the loop.
- If str[i] = ‘a’ and str[i+1] = ‘z’, again continue with the loop.
- Else mark flag variable as false and break from the loop.
- Finally, if the flag is true print YES else print NO.
Below is the implementation of the above approach :
Time Complexity: O(N)
Auxiliary Space: 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.