Assume you have a binary number 00110010, you apply some function on it and the number changes to some random number 10100011. Write a function to determine which numbers flipped from 0 to 1 and which bits flipped from 1 to 0. (You will have to write 2 different functions for 0 to 1 and 1 to 0).
Many sticks with length, every time combine two, the cost is the sum of two sticks' length. Finally, it will become a stick, what's the minimum cost?
they asked me to code for such a question: the input was a string and I was supposed to output the longest sub string with only 2 distinct chars in the sub string.
The dude basically asked me "what weird things have you found in using C?" Odd question...
Giving you a starting position on a chessboard. Giving you an end position. If you are only allowed to walk diagonally, how many steps do you need to take to get to the end position?
Find the top minimal m elements of n elements in O(n) time
Remove the duplicates from an array in place
I was asked a question about the following. If a user types in a n digit number on the telephone, how do you write a function to deduce if the number constitutes a valid word. For example, if the user enters 123, then can a valid word be made out of (a/b/c) + (d/e/f) + (g/h/i)
Give 2 coding solutions on returning an array by removing duplicates. One solution with O(n^2) and the other Linear.
Given an array whose elements are sorted, return the index of a the first occurrence of a specific integer. Do this in sub-linear time. I.e. do not just go through each element searching for that element.
Viewing 1491 - 1500 interview questions