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?
Find the top minimal m elements of n elements in O(n) time
Input a matrix, where every number is greater or equal to the numbers on its right and bottom. Output a sorted array
Given an english sentence how can you tell if it is valid or not. For Eg. "Iworkatuber" is a valid sentence "Iworkatasdf" is an invalid sentence.
Write a class that can take in an endless stream of numbers, one integer at a time, can efficiently store the most recent n numbers and report their average in O(1) time.
Remove the duplicates from an array in place
Write a Square Root function for a computer without floating point calculations
"what do you do if your manager says your code is a piece of sh*t?"
Solve a Kakuro item - Given S - the sum, N - number of slots and P - you can use numbers between 1 - P. You should only use a number once and same numbers are considered as the same solution. Example: S=6, N=2, P=6 Answers: 1. 4,2 2. 5,1 3. 3,3
Viewing 1501 - 1510 interview questions