Remove consecutive vowels from string

Given a string s of lowercase letters, we need to remove consecutive vowels from the string

Note : Sentence should not contain two consecutive vowels ( a, e, i, o, u).

Examples :

Input: geeks for geeks
Output: geks for geks

Input : your article is in queue 
Output : yor article is in qu


Approach: Iterate string using a loop and check for the repetitiveness of vowels in a given sentence and in case if consecutive vowels are found then delete the vowel till coming next consonant and printing the updated string.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program for printing sentence
// without repetitive vowels
#include <bits/stdc++.h>
using namespace std;
  
// function which returns True or False
// for occurrence of a vowel
bool is_vow(char c)
{
    // this compares vowel with 
    // character 'c'
    return (c == 'a') || (c == 'e') || 
           (c == 'i') || (c == 'o') || 
           (c == 'u');
}
  
// function to print resultant string
void removeVowels(string str)
{
    // print 1st character
    printf("%c", str[0]);
  
    // loop to check for each character
    for (int i = 1; str[i]; i++)
  
        // comparison of consecutive characters
        if ((!is_vow(str[i - 1])) || 
            (!is_vow(str[i])))
            printf("%c", str[i]);
}
  
// Driver Code
int main()
{
    char str[] = " geeks for geeks";
    removeVowels(str);
}
  
// This code is contributed by Abhinav96

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program for printing sentence
// without repetitive vowels
import java.io.*;
import java.util.*;
import java.lang.*;
  
class GFG
    // function which returns
    // True or False for
    // occurrence of a vowel
    static boolean is_vow(char c)
    {
        // this compares vowel 
        // with character 'c'
        return (c == 'a') || (c == 'e') || 
               (c == 'i') || (c == 'o') || 
               (c == 'u');
    }
      
    // function to print
    // resultant string
    static void removeVowels(String str)
    {
        // print 1st character
        System.out.print(str.charAt(0));
      
        // loop to check for 
        // each character
        for (int i = 1
                 i < str.length(); i++)
      
            // comparison of 
            // consecutive characters
            if ((!is_vow(str.charAt(i - 1))) || 
                (!is_vow(str.charAt(i))))
                System.out.print(str.charAt(i));
    }
      
    // Driver Code
    public static void main(String[] args)
    {
        String str = "geeks for geeks";
        removeVowels(str);
    }
}

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation for printing 
# sentence without repetitive vowels
  
# function which returns True or False
# for occurrence of a vowel
def is_vow(c):
  
    # this compares vowel with 
    # character 'c'
    return ((c == 'a') or (c == 'e') or 
            (c == 'i') or (c == 'o') or 
            (c == 'u'));
  
# function to print resultant string
def removeVowels(str):
  
    # print 1st character
    print(str[0], end = "");
  
    # loop to check for each character
    for i in range(1,len(str)):
  
        # comparison of consecutive
        # characters
        if ((is_vow(str[i - 1]) != True) or 
            (is_vow(str[i]) != True)):
              
            print(str[i], end = "");
  
# Driver code
str= " geeks for geeks";
removeVowels(str);
  
# This code is contributed by mits 

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program for printing sentence
// without repetitive vowels
using System;
  
class GFG
    // function which returns
    // True or False for
    // occurrence of a vowel
    static bool is_vow(char c)
    {
        // this compares vowel 
        // with character 'c'
        return (c == 'a') || (c == 'e') || 
               (c == 'i') || (c == 'o') || 
               (c == 'u');
    }
      
    // function to print
    // resultant string
    static void removeVowels(string str)
    {
        // print 1st character
        Console.Write(str[0]);
      
        // loop to check for 
        // each character
        for (int i = 1; i < str.Length; i++)
      
            // comparison of 
            // consecutive characters
            if ((!is_vow(str[i - 1])) || 
                (!is_vow(str[i])))
                Console.Write(str[i]);
    }
      
    // Driver Code
    static void Main()
    {
        string str = "geeks for geeks";
        removeVowels(str);
    }
}
  
// This code is contributed 
// by Manish Shaw(manishshaw1)

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP implementation for printing 
// sentence without repetitive vowels
  
// function which returns True or False
// for occurrence of a vowel
function is_vow($c)
{
    // this compares vowel with 
    // character 'c'
    return ($c == 'a') || ($c == 'e') || 
           ($c == 'i') || ($c == 'o') || 
           ($c == 'u');
}
  
// function to print resultant string
function removeVowels($str)
{
    // print 1st character
    printf($str[0]);
  
    // loop to check for each character
    for ($i = 1; $i < strlen($str); $i++)
  
        // comparison of consecutive
        // characters
        if ((!is_vow($str[$i - 1])) || 
            (!is_vow($str[$i])))
              
            printf($str[$i]);
}
  
// Driver code
$str= " geeks for geeks";
removeVowels($str);
  
// This code is contributed by mits 
?>

chevron_right


Output :

geks for geks


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

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.



Improved By : Mithun Kumar, manishshaw1



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.