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….”
Examples:
Input:_ str__ = “_cbaz”
Output:_ YES _
Explanation:
Given string “cbaz” is a valid sub string of S.
Input:_ str__ = “_ywxtuv”
Output:_ NO_
Explanation:
_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:
Below is the implementation of the above approach :
// C++ program for the above approach
#include <iostream>
**using**
**namespace**
std;
// Function checks if a given string is
// valid or not and prints the output
**void**
checkInfinite(string s)
{
// Boolean flag variable to mark
// if given string is valid
**bool**
flag = 1;
**int**
N = s.length();
// Traverse the given string
**for**
(``**int**
i = 0; i < N - 1; i++) {
// If adjacent character
// differ by 1
**if**
(s[i] ==
**char**``(``**int**``(s[i + 1]) + 1)) {
**continue**``;
}
// If character 'a' is
// followed by 4
**else**
**if**
(s[i] ==
'a'
&& s[i + 1] ==
'z'``) {
**continue**``;
}
// Else flip the flag and
// break from the loop
**else**
{
flag = 0;
**break**``;
}
}
// Output according to flag variable
**if**
(flag == 0)
cout <<
"NO"``;
**else**
cout <<
"YES"``;
}
// Driver Code
**int**
main()
{
// Given string
string s =
"ecbaz"``;
// Function Call
checkInfinite(s);
**return**
0;
}
Output:
NO
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.
#greedy #strings #cpp-string #school-programming #substring #java