Given string str of size N, the task is to remove the characters present at odd indices (0-based indexing) of a given string.
Examples :
Input: str = “abcdef”
Output: ace
Explanation:
The characters ‘b’, ‘d’ and ‘f’ are present at odd indices, i.e. 1, 3 and 5 respectively. Therefore, they are removed from the string.Input: str = “geeks”
Output: ges
Approach: Follow the steps below to solve the problem:
- Initialize an empty string, say new_string, to store the result.
- Traverse the given string and for every index, check if it is even or not.
- If found to be true, append the characters at those indices to the string new_string.
- Finally, after complete traversal of the entire string, return the new_string.
Below is the implementation of the above approach:
C++
// C++ program to implement // the above approach #include <bits/stdc++.h> using namespace std; // Function to remove the odd // indexed characters from a given string string removeOddIndexCharacters(string s) { // Stores the resultant string string new_string = ""; for (int i = 0; i < s.length(); i++) { // If current index is odd if (i % 2 == 1) { // Skip the character continue; } // Otherwise, append the // character new_string += s[i]; } // Return the result return new_string; } // Driver Code int main() { string str = "abcdef"; // Function call cout << removeOddIndexCharacters(str); return 0; } |
chevron_right
filter_none
Java
// Java program to implement // the above approach import java.util.*; class GFG { // Function to remove odd indexed // characters from a given string static String removeOddIndexCharacters( String s) { // Stores the resultant string String new_string = ""; for (int i = 0; i < s.length(); i++) { // If the current index is odd if (i % 2 == 1) // Skip the character continue; // Otherwise, append the // character new_string += s.charAt(i); } // Return the modified string return new_string; } // Driver Code public static void main(String[] args) { String str = "abcdef"; // Remove the characters which // have odd index str = removeOddIndexCharacters(str); System.out.print(str); } } |
chevron_right
filter_none
Python3
# Python3 program to implement # the above approach # Function to remove the odd # indexed characters from a given string def removeOddIndexCharacters(s): # Stores the resultant string new_s = "" i = 0 while i < len(s): # If the current index is odd if (i % 2 == 1): # Skip the character i+= 1 continue # Otherwise, append the # character new_s += s[i] i+= 1 # Return the modified string return new_s # Driver Code if __name__ == '__main__': str = "abcdef" # Remove the characters which # have odd index str = removeOddIndexCharacters(str) print(str) |
chevron_right
filter_none
C#
// C# program to implement // the above approach using System; class GFG{ // Function to remove odd indexed // characters from a given string static string removeOddIndexCharacters(string s) { // Stores the resultant string string new_string = ""; for(int i = 0; i < s.Length; i++) { // If the current index is odd if (i % 2 == 1) // Skip the character continue; // Otherwise, append the // character new_string += s[i]; } // Return the modified string return new_string; } // Driver Code public static void Main() { string str = "abcdef"; // Remove the characters which // have odd index str = removeOddIndexCharacters(str); Console.Write(str); } } // This code is contributed by sanjoy_62 |
chevron_right
filter_none
Output:
ace
Time Complexity: O(N)
Auxiliary Space: O(N)
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.
Recommended Posts:
- Replace even-indexed characters of minimum number of substrings to convert a string to another
- Remove odd frequency characters from the string
- Minimize replacements or swapping of same indexed characters required to make two given strings palindromic
- Minimum cost to remove the spaces between characters of a String by rearranging the characters
- Program to print product of even and odd indexed elements in an Array
- Remove characters from the first string which are present in the second string
- Remove minimum characters from string to split it into three substrings under given constraints
- Find value after N operations to remove N characters of string S with given constraints
- Remove characters from given string whose frequencies are a Prime Number
- Subsequences generated by including characters or ASCII value of characters of given string
- Remove all non-alphabetical characters of a String in Java
- How to remove all non-alphanumeric characters from a string in Java
- Remove even frequency characters from the string
- Remove characters from string that appears strictly less than K times
- Number of ways to remove a sub-string from S such that all remaining characters are same
- Remove characters from a String that appears exactly K times
- Remove all duplicate adjacent characters from a string using Stack
- Remove uppercase, lowercase, special, numeric, and non-numeric characters from a String
- Remove all characters other than alphabets from string
- Min flips of continuous characters to make all characters same in a string
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 : sanjoy_62
