Print reverse string after removing vowels
Last Updated :
06 Dec, 2023
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.
C++
#include <iostream>
#include <string>
using namespace std;
// Function to reverse a string
string reverseString(string s) {
string reversed;
// Iterate over the original string in reverse order
for (int i = s.length() - 1; i >= 0; i--) {
// Append each character to a new string
reversed += s[i];
}
// Return the reversed string
return reversed;
}
// Function to remove vowels from a string
string removeVowels(string s,string reversed) {
string withoutVowels;
// Iterate over the string
for (int i = 0; i < s.length(); i++) {
char c = s[i];
// Check if the character is a vowel in original string
if (c != 'a' && c != 'e' && c != 'i' && c != 'o' && c != 'u' && c != 'A' && c != 'E' && c != 'I' && c != 'O' && c != 'U') {
// If not, append the reversed string character to a new string
withoutVowels += reversed[i];
}
}
// Return the string without vowels
return withoutVowels;
}
int main() {
string s = "geeksforgeeks";
// Reverse the original string
string reversed = reverseString(s);
// Remove vowels from the reversed string
string withoutVowels = removeVowels(s,reversed);
// Print the resulting string without vowels
cout << withoutVowels << endl;
return 0;
}
// This code is contributed by Utkarsh.
public class Main {
public static void main(String[] args) {
String s = "geeksforgeeks";
// Reverse the original string
String reversed = reverseString(s);
// Remove vowels from the reversed string
String withoutVowels = removeVowels(s, reversed);
// Print the resulting string without vowels
System.out.println(withoutVowels);
}
// Function to reverse a string
public static String reverseString(String s) {
String reversed = "";
// Iterate over the original string in reverse order
for (int i = s.length() - 1; i >= 0; i--) {
// Append each character to a new string
reversed += s.charAt(i);
}
// Return the reversed string
return reversed;
}
// Function to remove vowels from a string
public static String removeVowels(String s, String reversed) {
String withoutVowels = "";
// Iterate over the string
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
// Check if the character is a vowel in original string
if (c != 'a' && c != 'e' && c != 'i' && c != 'o' && c != 'u' && c != 'A' && c != 'E' && c != 'I' && c != 'O' && c != 'U') {
// If not, append the reversed string character to a new string
withoutVowels += reversed.charAt(i);
}
}
// Return the string without vowels
return withoutVowels;
}
}
//This Code is written by Sundaram.
def reverseString(s):
reversed_string = ""
# Iterate over the original string in reverse order
for i in range(len(s) - 1, -1, -1):
# Append each character to a new string
reversed_string += s[i]
# Return the reversed string
return reversed_string
def removeVowels(s, reversed_string):
withoutVowels = ""
# Iterate over the string
for i in range(len(s)):
c = s[i]
# Check if the character is a vowel in original string
if c not in ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']:
# If not, append the reversed string character to a new string
withoutVowels += reversed_string[i]
# Return the string without vowels
return withoutVowels
if __name__ == "__main__":
s = "geeksforgeeks"
# Reverse the original string
reversed_string = reverseString(s)
# Remove vowels from the reversed string
withoutVowels = removeVowels(s, reversed_string)
# Print the resulting string without vowels
print(withoutVowels)
using System;
namespace ConsoleApp1 {
class Program {
// Function to reverse a string
static string ReverseString(string s)
{
string reversed = "";
// Iterate over the original string in reverse order
for (int i = s.Length - 1; i >= 0; i--) {
// Append each character to a new string
reversed += s[i];
}
// Return the reversed string
return reversed;
}
// Function to remove vowels from a string
static string RemoveVowels(string s, string reversed)
{
string withoutVowels = "";
// Iterate over the string
for (int i = 0; i < s.Length; i++) {
char c = s[i];
// Check if the character is a vowel in original
// string
if (c != 'a' && c != 'e' && c != 'i' && c != 'o'
&& c != 'u' && c != 'A' && c != 'E'
&& c != 'I' && c != 'O' && c != 'U') {
// If not, append the reversed string
// character to a new string
withoutVowels += reversed[i];
}
}
// Return the string without vowels
return withoutVowels;
}
static void Main(string[] args)
{
string s = "geeksforgeeks";
// Reverse the original string
string reversed = ReverseString(s);
// Remove vowels from the reversed string
string withoutVowels = RemoveVowels(s, reversed);
// Print the resulting string without vowels
Console.WriteLine(withoutVowels);
}
}
}
// This code is contributed by user_dtewbxkn77n
function reverseString(s) {
let reversed = "";
// Iterate over the original string in reverse order
for (let i = s.length - 1; i >= 0; i--) {
// Append each character to a new string
reversed += s[i];
}
// Return the reversed string
return reversed;
}
function removeVowels(s, reversed) {
let withoutVowels = "";
// Iterate over the string
for (let i = 0; i < s.length; i++) {
let c = s[i];
// Check if the character is a vowel in original string
if (c != 'a' && c != 'e' && c != 'i' && c != 'o' && c != 'u' && c != 'A' && c != 'E' && c != 'I' && c != 'O' && c != 'U') {
// If not, append the reversed string character to a new string
withoutVowels += reversed[i];
}
}
// Return the string without vowels
return withoutVowels;
}
let s = "geeksforgeeks";
// Reverse the original string
let reversed = reverseString(s);
// Remove vowels from the reversed string
let withoutVowels = removeVowels(s, reversed);
// Print the resulting string without vowels
console.log(withoutVowels);
Time complexity : O(n)
Auxiliary Space : O(n)
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 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 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# 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
<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>
Complexity Analysis:
- Time complexity : O(n)
- Auxiliary Space : O(n)
Approach:
In this approach, we will iterate through each character of the string, and if the character is not a vowel, we will append it to a new string. Finally, we will reverse the new string and return it as the output.
Steps:
- Create an empty string called "new_string".
- Iterate through each character of the input string.
- If the character is not a vowel, append it to "new_string".
- Reverse the "new_string" using string slicing.
- Return the reversed string as the output.
C++
#include <iostream>
#include <string>
#include<bits/stdc++.h>
// Function to reverse a string without vowels
std::string reverseStringWithoutVowels(const std::string& inputString) {
// Define vowels
std::string vowels = "AEIOUaeiou";
// Initialize an empty string to store the result
std::string newString = "";
// Iterate through each character in the input string
for (char ch : inputString) {
// Check if the character is not a vowel
if (vowels.find(ch) == std::string::npos) {
// Append the character to the new string
newString += ch;
}
}
// Reverse the new string
std::reverse(newString.begin(), newString.end());
// Return the reversed string without vowels
return newString;
}
int main() {
// Test the function
std::string inputString = "geeksforgeeks";
std::string outputString = reverseStringWithoutVowels(inputString);
std::cout << outputString << std::endl;
return 0;
}
// This code is contributed by shivamgupta0987654321
import java.util.Scanner;
public class ReverseStringWithoutVowels {
// Function to reverse a string without vowels
static String reverseStringWithoutVowels(String inputString) {
// Define vowels
String vowels = "AEIOUaeiou";
// Initialize a StringBuilder to store the result
StringBuilder newString = new StringBuilder();
// Iterate through each character in the input string
for (char ch : inputString.toCharArray()) {
// Check if the character is not a vowel
if (vowels.indexOf(ch) == -1) {
// Append the character to the StringBuilder
newString.append(ch);
}
}
// Reverse the StringBuilder
newString.reverse();
// Return the reversed string without vowels
return newString.toString();
}
public static void main(String[] args) {
// Test the function
String inputString = "geeksforgeeks";
String outputString = reverseStringWithoutVowels(inputString);
System.out.println(outputString);
}
}
def reverse_string_without_vowels(input_string):
vowels = "AEIOUaeiou"
new_string = ""
for char in input_string:
if char not in vowels:
new_string += char
return new_string[::-1]
# Test the function
input_string = "geeksforgeeks"
output_string = reverse_string_without_vowels(input_string)
print(output_string)
using System;
class Program
{
// Function to reverse a string after removing vowels
static string ReverseStringWithoutVowels(string inputString)
{
// Define a string containing all the vowels in uppercase and lowercase
string vowels = "AEIOUaeiou";
// Initialize a string to store the characters without vowels
string newString = "";
// Iterate through each character in the input string
foreach (char c in inputString)
{
// Check if the character is not a vowel
if (vowels.IndexOf(c) == -1)
{
// If it's not a vowel, add it to the new string
newString += c;
}
}
// Convert the new string to a character array
char[] charArray = newString.ToCharArray();
// Reverse the character array
Array.Reverse(charArray);
// Convert the reversed character array back to a string
return new string(charArray);
}
static void Main()
{
// Test the ReverseStringWithoutVowels function
string inputString = "geeksforgeeks";
string outputString = ReverseStringWithoutVowels(inputString);
// Print the reversed string without vowels
Console.WriteLine(outputString);
}
}
function reverseStringWithoutVowels(inputString) {
const vowels = "AEIOUaeiou";
let newString = "";
for (let i = inputString.length - 1; i >= 0; i--) {
if (!vowels.includes(inputString[i])) {
newString += inputString[i];
}
}
return newString;
}
// Test the function
const inputString = "geeksforgeeks";
const outputString = reverseStringWithoutVowels(inputString);
console.log(outputString);
Time Complexity: The time complexity of this approach is O(n), where n is the length of the input string.
Auxiliary Space: The auxiliary space used in this approach is O(n), where n is the length of the input string.
Print reverse string after removing vowels
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem