Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Print reverse string after removing vowels

  • Difficulty Level : Basic
  • Last Updated : 15 Sep, 2021

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

 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

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++




// 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;
}
Java



// 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
Python3



# Python3 Program for removing characters
# from reversed string where vowels are
# present in original string
 
# Function for replacing the string
def replaceOriginal(s, n):
 
    # initialize a string of length n
    r = [' '] * n
 
    # Traverse through all characters of string
    for i in range(n):
 
        # 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' and s[i] != 'e' and
            s[i] != 'i' and s[i] != 'o' and
            s[i] != 'u'):
            print(r[i], end = "")
    print()
 
# Driver Code
if __name__ == "__main__":
    s = "geeksforgeeks"
    n = len(s)
    replaceOriginal(s, n)
 
# This code is contributed by
# sanjeev2552
C#



// 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
Javascript



<script>
 
// JavaScript Program for removing characters
// from reversed string where vowels are
// present in original string
// Function for replacing the string
function replaceOriginal(s, n)
{
 
        // initialize a string of length n
        var r = new Array(n);
 
        // Traverse through all characters of string
        for (var 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') {
                document.write(r[i]);
            }
        }
        document.write("");
    }
 
// Driver function
var s = "geeksforgeeks";
var n = s.length;
replaceOriginal(s, n);
 
// This code is contributed by shivanisinghss2110
 
</script>
Output: 
 
segrfseg
 
 



My Personal Notes
arrow_drop_up
Previous
Longest substring of 0s in a string formed by k concatenations
Next

Delhivery Interview Experience | Set 4 (Off-Campus)
Recommended Articles
Page :
Print string after removing all (“10” or “01”) from the binary string
14, Apr 20
Find the number of words of X vowels and Y consonants that can be formed from M vowels and N consonants
23, Jul 19
Modify string by removing vowels in between two consonants
09, Jul 18
Sort array of strings after sorting each string after removing characters whose frequencies are not a powers of 2
14, Apr 21
Reverse vowels in a given string
21, Jun 17
Minimum swaps required to move all vowels occurs after consonants in a given string
30, Jun 20
Character replacement after removing duplicates from a string
19, Jul 18
Minimum sum of squares of character counts in a given string after removing k characters
10, Jun 17
Balance a string after removing extra brackets
03, Oct 18
Find the resultant String after replacing X with Y and removing Z
09, Jan 20
Check if string remains palindrome after removing given number of characters
28, Jan 20
Check if string is palindrome after removing all consecutive duplicates
20, Jun 20
Find the player with least 0s after emptying a Binary String by removing non-empty substrings
28, Jan 21
Check if a string can be converted to another string by replacing vowels and consonants
11, Feb 19
Find the player to last modify a string such that even number of consonants and no vowels are left in the string
14, Oct 20
Count of index pairs (i, j) such that string after deleting ith character is equal to string after deleting jth character
30, Nov 21
Print number of words, vowels and frequency of each character
13, Dec 17
Print an N x M matrix such that each row and column has all the vowels in it
21, May 19
Print the Vowels in the Order of their occurrence in the given Matrix
19, Aug 20
Count of unique pairs (i, j) in an array such that sum of A[i] and reverse of A[j] is equal to sum of reverse of A[i] and A[j]
12, Feb 21
Print reverse of a string using recursion
19, Jun 09
Print words of a string in reverse order
04, Nov 17
Sentence Palindrome (Palindrome after removing spaces, dots, .. etc)
31, Jul 17
Subsequence queries after removing substrings
24, Dec 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Krimson coder
@Krimson coder
Vote for difficulty
Current difficulty :
Basic





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

Start Your Coding Journey Now!