Given a string str, the task is to check whether every group of consecutive a’s is followed by a group of consecutive b’s of same length. If the condition is true for every group then print 1 else print 0.
Examples:
Input: str = “ababaabb”
Output: 1
ab, ab, aabb. All groups are validInput: str = “aabbabb”
Output: 0
aabb, abb (A single ‘a’ followed by 2 ‘b’)
Approach:
- For every a in the string increment the count.
- Starting from the first b, decrement the count for every b.
- If at the end of the above cycle, count != 0 then return false.
- Else repeat the first two steps for the rest of the string.
- Return true if the condition is satisfied for all the cycles else print 0.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to match whether there are always n consecutive b's // followed by n consecutive a's throughout the string int matchPattern(string s) { int count = 0; int n = s.length(); // Traverse through the string int i = 0; while (i < n) { // Count a's in current segment while (i < n && s[i] == 'a') { count++; i++; } // Count b's in current segment while (i < n && s[i] == 'b') { count--; i++; } // If both counts are not same. if (count != 0) return false; } return true; } // Driver code int main() { string s = "bb"; if (matchPattern(s) == true) cout << "Yes"; else cout << "No"; return 0; } |
chevron_right
filter_none
Java
// Java implementation of the above approach public class GFG{ // Function to match whether there are always n consecutive b's // followed by n consecutive a's throughout the string static boolean matchPattern(String s) { int count = 0; int n = s.length(); // Traverse through the string int i = 0; while (i < n) { // Count a's in current segment while (i < n && s.charAt(i) == 'a') { count++; i++; } // Count b's in current segment while (i < n && s.charAt(i) == 'b') { count--; i++; } // If both counts are not same. if (count != 0) return false; } return true; } // Driver code public static void main(String []args) { String s = "bb"; if (matchPattern(s) == true) System.out.println("Yes"); else System.out.println("No"); } // This code is contributed by Ryuga } |
chevron_right
filter_none
Python3
# Python 3 implementation of the approach # Function to match whether there are # always n consecutive b's followed by # n consecutive a's throughout the string def matchPattern(s): count = 0; n = len(s); # Traverse through the string i = 0; while (i < n) : # Count a's in current segment while (i < n and s[i] == 'a'): count += 1 ; i =+ 1; # Count b's in current segment while (i < n and s[i] == 'b'): count -= 1 ; i += 1; # If both counts are not same. if (count != 0): return False; return True; # Driver code s = "bb"; if (matchPattern(s) == True): print("Yes"); else: print("No"); # This code is contributed # by Akanksha Rai |
chevron_right
filter_none
C#
// C# implementation of the above approach using System; public class GFG{ // Function to match whether there are always n consecutive b's // followed by n consecutive a's throughout the string static bool matchPattern(string s) { int count = 0; int n = s.Length; // Traverse through the string int i = 0; while (i < n) { // Count a's in current segment while (i < n && s[i] == 'a') { count++; i++; } // Count b's in current segment while (i < n && s[i] == 'b') { count--; i++; } // If both counts are not same. if (count != 0) return false; } return true; } // Driver code public static void Main() { string s = "bb"; if (matchPattern(s) == true) Console.Write("Yes"); else Console.Write("No"); } } |
chevron_right
filter_none
PHP
<?php //PHP implementation of the approach // Function to match whether there are always n consecutive b's // followed by n consecutive a's throughout the string function matchPattern($s) { $count = 0; $n = strlen($s); // Traverse through the string $i = 0; while ($i < $n) { // Count a's in current segment while ($i < $n && $s[$i] == 'a') { $count++; $i++; } // Count b's in current segment while ($i < $n && $s[$i] == 'b') { $count--; $i++; } // If both counts are not same. if ($count != 0) return false; } return true; } // Driver code $s = "bb"; if (matchPattern($s) == true) echo "Yes"; else echo "No"; // This code is contributed by ajit ?> |
chevron_right
filter_none
Output:
No
Recommended Posts:
- String formed with middle character of every right substring followed by left sequentially
- Check if a string can be split into substrings starting with N followed by N characters
- Decode a string recursively encoded as count followed by substring
- Rearrange a string in sorted order followed by the integer sum
- Rearrange a string in the form of integer sum followed by the minimized character
- Print 2-D co-ordinate points in ascending order followed by their frequencies
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Check whether two strings contain same characters in same order
- Group words with same set of characters
- Group consecutive characters of same type in a string
- Minimum Group Flips to Make Binary Array Elements Same
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Map every character of one string to another such that all occurrences are mapped to the same character
- Maximize product of same-indexed elements of same size subsequences
- Minimum K such that every substring of length atleast K contains a character c
- Replace every consonant sequence with its length in the given string
- Count of distinct permutations of every possible length of given string
- Longest Even Length Substring such that Sum of First and Second Half is same
- Find all even length binary sequences with same sum of first and second half bits
- Maximum length substring having all same characters after k changes
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.
