Skip to content
Related Articles

Related Articles

Check if a string can be split into two substrings with equal number of vowels
  • Last Updated : 13 May, 2021

Given a string S, the task is to check if the string can be split into two substrings such that the number of vowels in both of them are equal. If found to be true, then print “Yes”. Otherwise, print “No”.

Examples:

Input: S = “geeks”
Output: Yes
Explanation: Splitting the strings into substrings “ge” (count of vowels = 1) and “eks” (count of vowels = 1) satisfies the condition.

Input: S = “textbook”
Output: No

Naive Approach: The simplest approach to solve this problem is to traverse the given string S and partition the string into two substrings at every possible index. For each such split, check if the two substrings have the same number of vowels present in them or not. If found to be true, then print “Yes” else print “No”. 
Time Complexity: O(N2)
Auxiliary Space: O(1)

Efficient Approach: The above approach can be optimized by pre-calculating the total number of vowels in the string. Follow the steps below to solve the problem:

  • Initialize two variables, say totalVowels and vowelsTillNow, to store the total number of vowels and the current count of vowels respectively.
  • Now traverse the string S and count all the vowels and store it in the totalVowels.
  • Now, again traverse the string S and decrement totalVowels by 1 and increment vowelsTillNow by 1, if a vowel occurs. Check if totalVowels become equal to vowelsTillNow at any point or not. If found to be true, then print “Yes”. Otherwise, print “No”.

Below is the implementation of the above approach:

C++




// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if any
// character is a vowel or not
bool isVowel(char ch)
{
   
    // Lowercase vowels
    if (ch == 'a' || ch == 'e' || ch == 'i'
        || ch == 'o' || ch == 'u')
        return true;
 
    // Uppercase vowels
    if (ch == 'A' || ch == 'E' || ch == 'I'
        || ch == 'O' || ch == 'U')
        return true;
 
    // Otherwise
    return false;
}
 
// Function to check if string S
// can be split into two substrings
// with equal number of vowels
string containsEqualStrings(string S)
{
 
    // Stores the count of vowels
    // in the string S
    int totalVowels = 0;
 
    // Traverse over the string
    for (int i = 0;
         i < S.size(); i++)
    {
 
        // If S[i] is vowel
        if (isVowel(S[i]))
            totalVowels++;
    }
 
    // Stores the count of vowels
    // upto the current index
    int vowelsTillNow = 0;
 
    // Traverse over the string
    for (int i = 0;
         i < S.size(); i++)
    {
 
        // If S[i] is vowel
        if (isVowel(S[i]))
        {
            vowelsTillNow++;
            totalVowels--;
 
            // If vowelsTillNow and
            // totalVowels are equal
            if (vowelsTillNow
                == totalVowels)
            {
 
                return "Yes";
            }
        }
    }
 
    // Otherwise
    return "No";
}
 
// Driver Code
int main()
{
    string S = "geeks";
    cout<<(containsEqualStrings(S));
}
 
// This code is contributed by mohit kumar 29.
Java



// Java program for the above approach
 
import java.io.*;
 
class GFG {
 
    // Function to check if any
    // character is a vowel or not
    public static boolean isVowel(char ch)
    {
        // Lowercase vowels
        if (ch == 'a' || ch == 'e' || ch == 'i'
            || ch == 'o' || ch == 'u')
            return true;
 
        // Uppercase vowels
        if (ch == 'A' || ch == 'E' || ch == 'I'
            || ch == 'O' || ch == 'U')
            return true;
 
        // Otherwise
        return false;
    }
 
    // Function to check if string S
    // can be split into two substrings
    // with equal number of vowels
    public static String
    containsEqualStrings(String S)
    {
 
        // Stores the count of vowels
        // in the string S
        int totalVowels = 0;
 
        // Traverse over the string
        for (int i = 0;
             i < S.length(); i++) {
 
            // If S[i] is vowel
            if (isVowel(S.charAt(i)))
                totalVowels++;
        }
 
        // Stores the count of vowels
        // upto the current index
        int vowelsTillNow = 0;
 
        // Traverse over the string
        for (int i = 0;
             i < S.length(); i++) {
 
            // If S[i] is vowel
            if (isVowel(S.charAt(i))) {
                vowelsTillNow++;
                totalVowels--;
 
                // If vowelsTillNow and
                // totalVowels are equal
                if (vowelsTillNow
                    == totalVowels) {
 
                    return "Yes";
                }
            }
        }
 
        // Otherwise
        return "No";
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        String S = "geeks";
        System.out.println(
            containsEqualStrings(S));
    }
}
Python3



# Python3 program for the above approach
 
# Function to check if any
# character is a vowel or not
def isVowel(ch):
     
    # Lowercase vowels
    if (ch == 'a' or ch == 'e' or
        ch == 'i' or ch == 'o' or
        ch == 'u'):
        return True
 
    # Uppercase vowels
    if (ch == 'A' or ch == 'E' or
        ch == 'I' or ch == 'O' or
        ch == 'U'):
        return True
 
    # Otherwise
    return False
 
# Function to check if string S
# can be split into two substrings
# with equal number of vowels
def containsEqualStrings(S):
 
    # Stores the count of vowels
    # in the string S
    totalVowels = 0
 
    # Traverse over the string
    for i in range(len(S)):
 
        # If S[i] is vowel
        if (isVowel(S[i])):
            totalVowels += 1
 
    # Stores the count of vowels
    # upto the current index
    vowelsTillNow = 0
 
    # Traverse over the string
    for i in range(len(S)):
 
        # If S[i] is vowel
        if (isVowel(S[i])):
            vowelsTillNow += 1
            totalVowels -= 1
 
            # If vowelsTillNow and
            # totalVowels are equal
            if (vowelsTillNow == totalVowels):
                return "Yes"
 
    # Otherwise
    return "No"
 
# Driver Code
if __name__ == "__main__":
 
    S = "geeks"
    print(containsEqualStrings(S))
 
# This code is contributed by ukasp
C#



// C# program for the above approach
using System;
class GFG
{
 
    // Function to check if any
    // character is a vowel or not
    public static bool isVowel(char ch)
    {
       
        // Lowercase vowels
        if (ch == 'a' || ch == 'e' || ch == 'i'
            || ch == 'o' || ch == 'u')
            return true;
 
        // Uppercase vowels
        if (ch == 'A' || ch == 'E' || ch == 'I'
            || ch == 'O' || ch == 'U')
            return true;
 
        // Otherwise
        return false;
    }
 
    // Function to check if string S
    // can be split into two substrings
    // with equal number of vowels
    public static String
    containsEqualStrings(string S)
    {
 
        // Stores the count of vowels
        // in the string S
        int totalVowels = 0;
 
        // Traverse over the string
        for (int i = 0;
             i < S.Length; i++)
        {
 
            // If S[i] is vowel
            if (isVowel(S[i]))
                totalVowels++;
        }
 
        // Stores the count of vowels
        // upto the current index
        int vowelsTillNow = 0;
 
        // Traverse over the string
        for (int i = 0;
             i < S.Length; i++) {
 
            // If S[i] is vowel
            if (isVowel(S[i])) {
                vowelsTillNow++;
                totalVowels--;
 
                // If vowelsTillNow and
                // totalVowels are equal
                if (vowelsTillNow
                    == totalVowels) {
 
                    return "Yes";
                }
            }
        }
 
        // Otherwise
        return "No";
    }
 
// Driver Code
static public void Main()
{
    string S = "geeks";
    Console.WriteLine(
        containsEqualStrings(S));
}
}
 
// This code is contributed by code_hunt.
Javascript



<script>
      // JavaScript program for the above approach
      // Function to check if any
      // character is a vowel or not
      function isVowel(ch) {
        // Lowercase vowels
        if (ch === "a" || ch === "e" || ch === "i" || ch === "o" || ch === "u")
          return true;
 
        // Uppercase vowels
        if (ch === "A" || ch === "E" || ch === "I" || ch === "O" || ch === "U")
          return true;
 
        // Otherwise
        return false;
      }
 
      // Function to check if string S
      // can be split into two substrings
      // with equal number of vowels
      function containsEqualStrings(S) {
        // Stores the count of vowels
        // in the string S
        var totalVowels = 0;
 
        // Traverse over the string
        for (var i = 0; i < S.length; i++) {
          // If S[i] is vowel
          if (isVowel(S[i])) totalVowels++;
        }
 
        // Stores the count of vowels
        // upto the current index
        var vowelsTillNow = 0;
 
        // Traverse over the string
        for (var i = 0; i < S.length; i++) {
          // If S[i] is vowel
          if (isVowel(S[i])) {
            vowelsTillNow++;
            totalVowels--;
 
            // If vowelsTillNow and
            // totalVowels are equal
            if (vowelsTillNow === totalVowels) {
              return "Yes";
            }
          }
        }
 
        // Otherwise
        return "No";
      }
 
      // Driver Code
      var S = "geeks";
      document.write(containsEqualStrings(S));
    </script>
Output: 
Yes
 
Time Complexity: O(N)
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Previous
Generate an N-length array A[] from an array arr[] such that arr[i] is the last index consisting of a multiple of A[i]
Next

Count pairs from an array having equal sum and quotient
Recommended Articles
Page :
Split the binary string into substrings with equal number of 0s and 1s
14, Nov 19
Split a given string into substrings of length K with equal sum of ASCII values
25, Jun 20
Check whether all the substrings have number of vowels atleast as that of consonants
14, Nov 19
Check if a string can be split into 3 substrings such that one of them is a substring of the other two
05, Apr 21
Count the number of vowels occurring in all the substrings of given string
16, Nov 18
Check if a string can be split into substrings starting with N followed by N characters
06, Jul 20
Check if a string can be split into even length palindromic substrings
20, Jun 20
Check if a palindromic string can be obtained by concatenating substrings split from same indices of two given strings
16, Oct 20
Split a string into maximum number of unique substrings
03, Feb 21
Count ways to split a Binary String into three substrings having equal count of zeros
09, Sep 20
Check if all substrings of length K of a Binary String has equal count of 0s and 1s
08, Sep 20
Check if a string can be split into two substrings such that one substring is a substring of the other
23, Dec 20
Queries to find the count of vowels in the substrings of the given string
13, Nov 19
Count of substrings consisting of even number of vowels
28, Jul 20
Split the string into substrings using delimiter
03, Dec 17
Check if a string can be split into two strings with same number of K-frequent characters
08, Jul 20
Check if a Binary String can be converted to another by reversing substrings consisting of even number of 1s
16, Dec 20
Split string into three palindromic substrings with earliest possible cuts
01, Oct 20
Remove minimum characters from string to split it into three substrings under given constraints
26, Jun 20
Split a Binary String such that count of 0s and 1s in left and right substrings is maximum
14, Feb 21
Check if a string can be converted to another string by replacing vowels and consonants
11, Feb 19
Check if count of substrings in S with string S1 as prefix and S2 as suffix is equal to that with S2 as prefix and S1 as suffix
13, Apr 21
Check length of a string is equal to the number appended at its last
16, Jan 17
Check whether the vowels in a string are in alphabetical order or not
31, Oct 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
avaies
@avaies
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