Skip to content
Related Articles

Related Articles

Improve Article

Check If every group of a’s is followed by a group of b’s of same length

  • Last Updated : 10 May, 2021

Given string str, the task is to check whether every group of consecutive a’s is followed by a group of consecutive b’s of the 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 valid
Input: 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;
}
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
}
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
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");
}
 
}
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
?>
Javascript



<script>
 
    // Javascript implementation of
    // the above approach
     
    // Function to match whether there are
    // always n consecutive b's
    // followed by n consecutive a's
    // throughout the string
    function matchPattern(s)
    {
        let count = 0;
        let n = s.length;
 
        // Traverse through the string
        let 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;
    }
     
    let s = "bb";
    if (matchPattern(s) == true)
        document.write("Yes");
    else
        document.write("No");
     
</script>
Output: 
No
 
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for the language and STL. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.



My Personal Notes
arrow_drop_up
Previous
Number of sub-strings which are anagram of any sub-string of another string
Next

Floor of every element in same array
Recommended Articles
Page :
String formed with middle character of every right substring followed by left sequentially
30, Jun 20
Check if a string can be split into substrings starting with N followed by N characters
06, Jul 20
Decode a string recursively encoded as count followed by substring
22, Jun 17
Rearrange a string in sorted order followed by the integer sum
24, Jun 17
Rearrange a string in the form of integer sum followed by the minimized character
18, Nov 18
Print 2-D co-ordinate points in ascending order followed by their frequencies
15, Apr 19
Minimum removals to make a string concatenation of a substring of 0s followed by a substring of 1s
14, Dec 20
Length of longest Palindromic Subsequence of even length with no two adjacent characters same
04, Feb 20
Check if given strings can be made same by swapping two characters of same or different strings
07, Dec 20
Check whether two strings contain same characters in same order
31, May 19
Check if string can be rearranged so that every Odd length Substring is Palindrome
04, Sep 19
Lexicographically smallest permutation of a string that can be reduced to length K by removing K-length prefixes from palindromic substrings of length 2K
11, Nov 20
Group words with same set of characters
18, Mar 17
Group consecutive characters of same type in a string
01, Mar 19
Minimum Group Flips to Make Binary Array Elements Same
23, May 20
Map every character of one string to another such that all occurrences are mapped to the same character
16, Jul 19
Minimum number of characters required to be removed such that every character occurs same number of times
22, Mar 21
Maximize product of same-indexed elements of same size subsequences
09, Jun 20
Minimum K such that every substring of length atleast K contains a character c
25, Dec 18
Replace every consonant sequence with its length in the given string
27, Feb 19
Count of distinct permutations of every possible length of given string
20, Aug 20
Length of the longest substring with every character appearing even number of times
01, Nov 20
Maximum length palindromic substring for every index such that it starts and ends at that index
17, Feb 21
Modify string by inserting characters such that every K-length substring consists of unique characters only
14, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Devyansh_Ojha
@Devyansh_Ojha
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox