CareerCup

I think the C code will be Okay to remove all spaces in the string :input

int i = 0 ;
for (int j = 0 ;j <strlen(input);++j){
     if(input[j] != ' ')
       input[i++] = input[j];
}
input[i] = 0;

char[] data = {'a','a','b',' ',' ','c',' ','d','e'};
String s = new String(data);
s = s.replaceAll(" ", "");
System.out.println(s);

In C++, I always tray to used a developed algorithm instead of implementing a new one. And to remove a character nothing better than std::remove algorithm.

#include <iostream>
#include <algorithm>
 
int main()
{
    char str[] = "aab  c  de";
    std::remove(str, str+sizeof(str)/sizeof(str[0]), ' ');
    std::cout << str;
}

why can't we remove spaces while reading the string itself

reading a string:
  if input element is " ":
     don't include it in the string:
print string

public void removeSpaces(String str) {
int len = str.length();
for (int i = 0; i < len; i++) {
int pos = str.charAt(i);
// 32 is ascii value for Space
if (pos != 32) {
System.out.print((char) pos);
}

}
}

do we need to just print the output ? or modify that character array to remove the space?

shifting the characters seems better here,than taking a new array and only filling it with desired characters.

char temp[] = {'a',' ','a',' ','b',' ','c'};
String sb= new String();
for (int i = 0; i < temp.length; i++) {
if(temp[i]!=' '){
sb=sb+temp[i];
}
}

System.out.println(sb.toString());

public static void rm_space(char [] ar){

int i=0;
int j=0;
for (;i<ar.length;++i){
if (ar[i]!=' '){
ar[j++]=ar[i];
}
}

System.out.println(new String(ar,0,j));
}

char []a = {'a',' ','b',' ','c'};
StringBuffer str = new StringBuffer();
for (int i=0; i<a.length; i++){
if (a[i] != ' ')
str.append(a[i]);

}

System.out.println(str);

i am just trying it other way. let me know if i am approaching wrong way.
#include<stdio.h>
main()
{
char A[] ={'a','a','b',' ',' ','c',' ','d','e'};
int i=0;
int p=0;
int count = 0;
int length=sizeof(A)/sizeof(A[0]);
printf("Original array is:: %s\n and length of array is %d\n",A,strlen(A));
while(i<length)
{
if(A[i] == ' ')
{
if(count<1)
p = i;
count++;
}
else
{
if(count>=1)
{
A[p]=A[i];
p++;
count--;
}
}
i++;
}
A[p] = '\0';

printf("Final array is :: %s \n and legth of final string is %d\n",A,strlen(A));

getch();
}

char ch[] = new char[] { 'a', 'a', 'b', ' ', ' ', 'd', ' ', ' ', ' ',
'e', 'f', ' ' };
for (int i = 0; i < ch.length; i++) {
if (ch[i] == ' ') {
boolean swaped = false;
for (int j = i + 1; j < ch.length; j++) {
if (ch[j] != ' ') {
char temp = ch[i];
ch[i] = ch[j];
ch[j] = temp;
swaped = true;
break;
}
}
if (!swaped) {
break;
}
}
}

{
package my.practice.ds.puzzles;

import java.util.Arrays;

public class NextNonSpaceChar {

public static void main(String[] args) {
char ch[] = new char[] { 'a', 'a', 'b', ' ', ' ', 'd', ' ', ' ', ' ',
'e', 'f', ' ' };
for (int i = 0; i < ch.length; i++) {
if (ch[i] == ' ') {
boolean swaped = false;
for (int j = i + 1; j < ch.length; j++) {
if (ch[j] != ' ') {
char temp = ch[i];
ch[i] = ch[j];
ch[j] = temp;
swaped = true;
break;
}
}
if (!swaped) {
break;
}
}
}
System.out.println(Arrays.toString(ch));
}
}
}

char[] arr = {a, a,b, , , c};
     String word = arr.toString().replace(",", "" ).replace(" ", "");

thanks all.. I could clear all the rounds.. had almost 7 technical rounds..can someone tell me how good it is to join? scope? just asking

start from the end of the string.
In this way we can eliminate the need for shifting the characters

while((c = getchar()) != EOF)
if(c != ' ')
putchar(c)

Use regex.. [A-Za-z] or \w..

void removeSpaces(char str[],int size)
{
    int i=0,j = size-1;
    char temp;
    while(i<j)
    {
        while(str[i] != ' ')
        {
            i++;
        }
        while(str[j] == ' ' )
        {
            j--;
        }

        if(i<j)
        {
            temp = str[i];
            str[i] = str[j];
            str[j] = temp;
        }
    }
    str[i+1] = "\0";
}

Why not use divide and conquer? I know it would be the same time complexity with linear way. But it is an interview.
Come on bro!

import java.util.*;

public class RemoveSpaces {
	public static void main(String[] args) {
		char[] myChars = {'a', 'a', 'b', ' ', ' ', 'c', ' ', ' ', 'd'};
		String myString = new String(myChars);
		char[] charArrayNoSpaces = myString.replaceAll(" ", "").toCharArray();
	}
}

In C# we can use this:

input = new String(input.ToString().Where(Char.IsLetter).ToArray());

Console.Write(input);

java code

public class OnlyAlphabetsString {

	
	public static void main(String[] args) {
		
		String str= "a,a,b, , , c, , ,d,e";
		String delim= "[ ,]";
		String[] atr= str.split(delim);
		String output =atr[0];
		for(int i=1;i<atr.length;i++)
		{
			output+=atr[i];
		}
		System.out.println(output);
	}
}