CareerCup

void revString(String s)
{

for(int i=0;i<len/2;i++) //len- stands for string length;
{

s[i]=s[i]+s[len-i];
s[len-i]=s[i]-s[len-i];
s[i]=s[i]-s[len-i];

}

}

Here is the C code.

#include <stdio.h>
void 
main()
{
char s[] = "abcd";
char temp;
int len_s = strlen(s);

	for (int i=0;i<len_s/2;i++)
	{
		temp = s[i];
		s[i] = s[len_s - i - 1];
		s[len_s - i -1] = temp;
	}
	printf ("%s\n", s);
}

And Here is the C++ Code.

#include <atlstr.h>
void 
main()
{
	CString s(_T("abcd"));
	s.MakeReverse ();
}

private static char[] reverseString_in_Char_Array(String string) {
char[] str = string.toCharArray();
boolean isPalindrom = true;
int j = str.length - 1;
for (int i = 0; i < (str.length) / 2; i++) {
if (str[i] == str[j]) {
j--;
continue;
} else {
isPalindrom = false;
char temp = str[i];
str[i] = str[j];
str[j] = temp;
j--;
}
}
System.out.println("Palindrom" + isPalindrom);
return str;
}

/**
* 1
*
* @param str
* @return
*/
private static StringBuilder reverseString(String str) {
StringBuilder sb = new StringBuilder();
for (int i = str.length() - 1; i >= 0; i--) {
sb = sb.append(str.charAt(i));
}
return sb;
}

Java:

StringBuffer s = new StringBuffer("hello");
System.out.println(s.reverse());

Python : ---

1.

s = 'INPUT_STRING'
chars = list(s)
reverse = ''.join(chars.reverse())

-------
2.
chars = list(s)
for i in range(len(chars)/2):
chars[i], chars[-1*(i+1)] = chars[-1*(i+1)], chars[i]

public static String reverse(String input) {
if(input == null)
return input;
if(input.length() <= 1)
return input;

return DIYString.reverse(input.substring(1)) + input.charAt(0);
}

void reverse(char input[], int len)
{
char* start = input;
char* end = input + len;

while (start < end)
{
char temp = *start;
*start = *end;
*end = temp;
++start;
--end;
}
}

basicalgos.blogspot.com/2012/03/4.html

It's difficult for me to believe that MS is asking such simple questions in f2f interviews. Can someone please comment on difficulty of MS in-person interviews?

s='test string'
print s[::-1]

Python

s='test string'
print s[::-1]

strrev('String');

}

void reverse(char *input, int size)
{
for(int i = 0;i<size/2;i++)
{
char temp;
temp = *(input+i);
*(input+i) = *(input+len-i-1);
*(input+len-i-1) = temp;
}
}

char *reverse(char *s, int n)
{
//n is strlen here
if (n<=1) return s;
return (strconcat(reverse(substring(s,1,n-1), n-1),substring(s,0,0),1);
}

char *reverse(char *s, int n)
{
//n is strlen here
if (n<=1) return s;
return (strconcat(reverse(substring(s,1,n-1), n-1),substring(s,0,0),1);
}

char *reverse(char *s, int n)
{
//n is strlen here
if (n<=1) return s;
return (strconcat(reverse(substring(s,1,n-1), n-1),substring(s,0,0),1);
}

Java
class StringReverse
{
public static void main(String... args)
{
Scanner scan=new Scanner(System.in);
System.out.println("enter a string");
str=scan.next();
StringBuffer sb=new StringBuffer(str);
sb.reverse();//a method in StringBuffer to reverse a string
System.out.println(sb);
}}

public static void reverseEntireString(char[] input){
if(input==null || input.length<=1)return;
for(int i=0;i<input.length/2;i++){
input[i]=(char) (input[input.length-1-i]^input[i]);
input[input.length-1-i]=(char) (input[input.length-1-i]^input[i]);
input[i]=(char) (input[input.length-1-i]^input[i]);
}
}

"String".reverse

Ruby

"String".reverse

Ruby

"String".reverse

C#
====

string reverseString(string text)
{
char[] arr = text.ToCharArray();
Array.Reverse(arr);
return new string(arr);
}

I bet here they want to see the recursive algorithm (that is the most interesting).

reverse(char* s)
{
if (*s)
reverse(s+1);
printf("%c",s);
}

void main()
{
char* s="abcd";
reverse(s);
}

char* reverse(char* str)
{
if(str)
{
size_t end = strlen(str) - 1;
size_t start = 0;

while(start < end)
{
str[start] ^= str[end];
str[end] ^= str[start];
str[start] ^= str[end];

start++;
end--;
}
}

return str;
}

Why cannot we use stack and pop out.

static class StringHelper
{
    /// <summary>
    /// Receives string and returns the string with its letters reversed.
    /// </summary>
    public static string ReverseString(string s)
    {
	char[] arr = s.ToCharArray();
	Array.Reverse(arr);
	return new string(arr);
    }
}

class Program
{
    static void Main()
    {
	Console.WriteLine(StringHelper.ReverseString("framework"));
	Console.WriteLine(StringHelper.ReverseString("samuel"));
	Console.WriteLine(StringHelper.ReverseString("example string"));
    }

static class StringHelper
{
    /// <summary>
    /// Receives string and returns the string with its letters reversed.
    /// </summary>
    public static string ReverseString(string s)
    {
	char[] arr = s.ToCharArray();
	Array.Reverse(arr);
	return new string(arr);
    }
}

class Program
{
    static void Main()
    {
	Console.WriteLine(StringHelper.ReverseString("framework"));
	Console.WriteLine(StringHelper.ReverseString("samuel"));
	Console.WriteLine(StringHelper.ReverseString("example string"));
    }