The question was: Given a text written in some language where the alphabets are represented with 1 byte or 2 byte. But the one byte alphabets always have their MSB 1 and the 2 byte charecters always have their MSB 0. Now when at some point user presses a back space how many bytes are to be deleted to erase the alphabet?
Write a function that returns the longest palindrome in a string. Not just the first one or any palindrome, but the longest. The String is a long sequence of characters, spaces included.
Find a duplicate integer in a list of length K with integers 1...K-1 and one duplicate. Do so in O(n) time with constant space.
Write a function that takes a String as a parameter. Count the number of A's in the String before you reach a C.
Write a function that reverses the letters in each word using only one char buffer. E.g.: "I work at Microsoft" to "I krow ta tfosorciM"
how can a particular application be tested apart from testing its functionality
Write a function to convert a number in Roman numeral form to a decimal representation.
Write a function to print out the contents of a singly-linked list in reverse order.
You've a singly linked list where every node in the list has a field "random" which points to other node in the same list. Write a function to clone this list (create a new copy of the same). Don't use extra space (just the pointer variables are fine).
How many gas stations are there in California?
Viewing 371 - 380 interview questions