Print reverse string after removing vowels

Given a string s, print reverse of string and remove the characters from the reversed string where there are vowels in the original string.

Examples:

Input : geeksforgeeks
Output : segrfseg
Explanation :
Reversed string is skeegrofskeeg, removing characters 
from indexes 1, 2, 6, 9 & 10 (0 based indexing),
we get segrfseg .

Input :duck
Output :kud



A simple solution is to first reverse the string, then traverse the reversed string and remove vowels.

An efficient solution is to do both tasks in one traversal.
Create an empty string r and traverse the original string s and assign the value to the string r. Check whether, at that index, the original string contains a consonant or not. If yes then print the element at that index from string r.

Basic implementation of the above approach :

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP Program for removing characters
// from reversed string where vowels are
// present in original string
#include <bits/stdc++.h>
using namespace std;
  
// Function for replacing the string
void replaceOriginal(string s, int n)
{
    // initialize a string of length n
    string r(n, ' ');
  
    // Traverse through all characters of string
    for (int i = 0; i < n; i++) {
  
        // assign the value to string r
        // from last index of string s
        r[i] = s[n - 1 - i];
  
        // if s[i] is a consonant then
        // print r[i]
        if (s[i] != 'a' && s[i] != 'e' && s[i] != 'i'
            && s[i] != 'o' && s[i] != 'u') {
            cout << r[i];
        }
    }
    cout << endl;
}
  
// Driver function
int main()
{
    string s = "geeksforgeeks";
    int n = s.length();
    replaceOriginal(s, n);
  
    return 0;
}

chevron_right






                        filter_none









Java














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Java Program for removing characters 


// from reversed string where vowels are 


// present in original string 


class GFG { 


  


// Function for replacing the string 


    static void replaceOriginal(String s, int n) { 


        // initialize a string of length n 


        char r[] = new char[n]; 


  


        // Traverse through all characters of string 


        for (int i = 0; i < n; i++) { 


  


            // assign the value to string r 


            // from last index of string s 


            r[i] = s.charAt(n - 1 - i); 


  


            // if s[i] is a consonant then 


            // print r[i] 


            if (s.charAt(i) != 'a' && s.charAt(i) != 'e' && s.charAt(i) != 'i'


                    && s.charAt(i) != 'o' && s.charAt(i) != 'u') { 


                System.out.print(r[i]); 


            } 


        } 


        System.out.println(""); 


    } 


  


// Driver function 


    public static void main(String[] args) { 


        String s = "geeksforgeeks"; 


        int n = s.length(); 


        replaceOriginal(s, n); 


    } 


}  


  


// This code is contributed by princiRaj1992 



















                        chevron_right







                        filter_none









C#














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// C# Program for removing characters 


// from reversed string where vowels are 


// present in original string 


using System; 


  


class GFG 


{ 


  


    // Function for replacing the string 


    static void replaceOriginal(String s, int n)  


    { 


        // initialize a string of length n 


        char []r = new char[n]; 


  


        // Traverse through all characters of string 


        for (int i = 0; i < n; i++)  


        { 


  


            // assign the value to string r 


            // from last index of string s 


            r[i] = s[n - 1 - i]; 


  


            // if s[i] is a consonant then 


            // print r[i] 


            if (s[i] != 'a' && s[i] != 'e' && s[i] != 'i'


                    && s[i] != 'o' && s[i] != 'u') 


            { 


                Console.Write(r[i]); 


            } 


        } 


        Console.WriteLine(""); 


    } 


  


    // Driver code 


    public static void Main(String[] args) 


    { 


        String s = "geeksforgeeks"; 


        int n = s.Length; 


        replaceOriginal(s, n); 


    } 


} 


  


// This code is contributed by Rajput-JI 



















                        chevron_right







                        filter_none










Output:


segrfseg




          
          
          
          

            

    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:
Krimson coder
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 :  princiraj1992, Rajput-Ji