Remove spaces from a given string
Last Updated :
06 Dec, 2024
Given a string, remove all spaces from the string and return it.
Input: "g eeks for ge eeks "
Output: "geeksforgeeks"
Input: "abc d "
Output: "abcd"
Expected time complexity is O(n) and only one traversal of string.
Below is a Simple Solution
1) Iterate through all characters of given string, do following
a) If current character is a space, then move all subsequent
characters one position back and decrease length of the
result string.Time complexity of above solution is O(n2).
A Better Solution can solve it in O(n) time. The idea is to keep track of count of non-space character seen so far.
1) Initialize 'count' = 0 (Count of non-space character seen so far)
2) Iterate through all characters of given string, do following
a) If current character is non-space, then put this character
at index 'count' and increment 'count'
3) Finally, put '\0' at index 'count'Below is the implementation of above algorithm.
C++
// An efficient C++ program to remove all spaces
// from a string
#include <iostream>
using namespace std;
// Function to remove all spaces from a given string
void removeSpaces(char *str)
{
// To keep track of non-space character count
int count = 0;
// Traverse the given string. If current character
// is not space, then place it at index 'count++'
for (int i = 0; str[i]; i++)
if (str[i] != ' ')
str[count++] = str[i]; // here count is
// incremented
str[count] = '\0';
}
// Driver program to test above function
int main()
{
char str[] = "g eeks for ge eeks ";
removeSpaces(str);
cout << str;
return 0;
}
// An efficient Java program to remove all spaces
// from a string
class GFG
{
// Function to remove all spaces
// from a given string
static int removeSpaces(char []str)
{
// To keep track of non-space character count
int count = 0;
// Traverse the given string.
// If current character
// is not space, then place
// it at index 'count++'
for (int i = 0; i<str.length; i++)
if (str[i] != ' ')
str[count++] = str[i]; // here count is
// incremented
return count;
}
// Driver code
public static void main(String[] args)
{
char str[] = "g eeks for ge eeks ".toCharArray();
int i = removeSpaces(str);
System.out.println(String.valueOf(str).subSequence(0, i));
}
}
// This code is contributed by Rajput-Ji
# Python program to Remove spaces from a given string
# Function to remove all spaces from a given string
def removeSpaces(string):
# To keep track of non-space character count
count = 0
list = []
# Traverse the given string. If current character
# is not space, then place it at index 'count++'
for i in xrange(len(string)):
if string[i] != ' ':
list.append(string[i])
return toString(list)
# Utility Function
def toString(List):
return ''.join(List)
# Driver program
string = "g eeks for ge eeks "
print removeSpaces(string)
# This code is contributed by Bhavya Jain
// An efficient C# program to remove all
// spaces from a string
using System;
class GFG
{
// Function to remove all spaces
// from a given string
static int removeSpaces(char []str)
{
// To keep track of non-space
// character count
int count = 0;
// Traverse the given string. If current
// character is not space, then place
// it at index 'count++'
for (int i = 0; i < str.Length; i++)
if (str[i] != ' ')
str[count++] = str[i]; // here count is
// incremented
return count;
}
// Driver code
public static void Main(String[] args)
{
char []str = "g eeks for ge eeks ".ToCharArray();
int i = removeSpaces(str);
Console.WriteLine(String.Join("", str).Substring(0, i));
}
}
// This code is contributed by 29AjayKumar
<script>
// An efficient JavaScript program to remove all
// spaces from a string
// Function to remove all spaces
// from a given string
function removeSpaces(str) {
// To keep track of non-space
// character count
var count = 0;
// Traverse the given string. If current
// character is not space, then place
// it at index 'count++'
for (var i = 0; i < str.length; i++)
if (str[i] !== " ") str[count++] = str[i];
// here count is
// incremented
return count;
}
// Driver code
var str = "g eeks for ge eeks ".split("");
var i = removeSpaces(str);
document.write(str.join("").substring(0, i));
</script>
Time complexity of above solution is O(n) and it does only one traversal of string.
Auxiliary Space: O(1)
Another solution suggested by Divyam Madaan is to use predefined functions. Here is the implementation:
C++
// CPP program to Remove spaces
// from a given string
#include <iostream>
#include <algorithm>
using namespace std;
// Function to remove all spaces from a given string
string removeSpaces(string str)
{
str.erase(remove(str.begin(), str.end(), ' '), str.end());
return str;
}
// Driver program to test above function
int main()
{
string str = "g eeks for ge eeks ";
str = removeSpaces(str);
cout << str;
return 0;
}
// This code is contributed by Divyam Madaan
// Java program to remove
// all spaces from a string
class GFG {
// Function to remove all
// spaces from a given string
static String removeSpace(String str)
{
str = str.replaceAll("\\s","");
return str;
}
// Driver Code
public static void main(String args[])
{
String str = "g eeks for ge eeks ";
System.out.println(removeSpace(str));
}
}
// This code is contributed by Kanhaiya.
# Python program to Remove spaces from a given string
# Function to remove all spaces from a given string
def removeSpaces(string):
string = string.replace(' ','')
return string
# Driver program
string = "g eeks for ge eeks "
print(removeSpaces(string))
# This code is contributed by Divyam Madaan
// C# program to remove
// all spaces from a string
using System;
class GFG
{
// Function to remove all
// spaces from a given string
static String removeSpace(String str)
{
str = str.Replace(" ","");
return str;
}
// Driver Code
public static void Main()
{
String str = "g eeks for ge eeks ";
Console.WriteLine(removeSpace(str));
}
}
// This code is contributed by
// PrinciRaj1992
<script>
// javascript program to remove
// all spaces from a string
// Function to remove all
// spaces from a given string
function removeSpace( str)
{
str = str.replace(/\s/g,'')
return str;
}
// Driver Code
var str = "g eeks for ge eeks ";
document.write(removeSpace(str));
// This code contributed by aashish1995
</script>
Another method to solve this problem using predefined STL functions like count() ,remove() ,getline() and resize() is also present. Here is the implementation for the same :
C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s = "g e e k s f o r g e e k s";
cout << "string with spaces is " << s << endl;
int l = s.length(); // storing the length of the string
int c
= count(s.begin(), s.end(),
' '); // counting the number of whitespaces
remove(s.begin(), s.end(),
' '); // removing all the whitespaces
s.resize(l - c); // resizing the string to l-c
cout << "string without spaces is " << s << endl;
return 0;
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
String s = "g e e k s f o r g e e k s";
System.out.println("string with spaces is " + s);
int l = s.length(); // storing the length of the string
int c = (int) s.chars().filter(ch -> ch == ' ').count(); // counting the number of whitespaces
s = s.replace(" ", ""); // removing all the whitespaces
s = s.substring(0, l - c); // resizing the string to l-c
System.out.println("string without spaces is " + s);
}
}
s = "g e e k s f o r g e e k s"
print("string with spaces is", s)
l = len(s) # storing the length of the string
c = s.count(' ') # counting the number of whitespaces
s = s.replace(' ', '') # removing all the whitespaces
s = s[:l - c] # resizing the string to l-c
print("string without spaces is", s)
// C# program for the above approach
using System;
public class GFG {
public static void Main(string[] args) {
string s = "g e e k s f o r g e e k s";
Console.WriteLine("string with spaces is " + s);
int l = s.Length; // storing the length of the string
int c = s.Split(' ').Length - 1; // counting the number of whitespaces
s = s.Replace(" ", ""); // removing all the whitespaces
s = s.Substring(0, l - c); // resizing the string to l-c
Console.WriteLine("string without spaces is " + s);
}
}
// This code is contributed by princekumaras
// JavaScript program for the above approach
let s = "g e e k s f o r g e e k s";
console.log("string with spaces is " + s);
let l = s.length; // storing the length of the string
let c = s.split(' ').length - 1; // counting the number of whitespaces
s = s.replace(/\s/g, ""); // removing all the whitespaces
s = s.substring(0, l - c); // resizing the string to l-c
console.log("string without spaces is " + s);
Outputstring with spaces is g e e k s f o r g e e k s
string without spaces is geeksforgeeks
Time Complexity : O(N), N is length of given string.
Auxiliary Space : O(1), since no extra space is used.
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