5 bags, each bag has some balls. 1 bag has faulty balls. There are faulty balls weighing 1.1kg and good ones weighing 1kg. There is a weighing machine. Determine in how many measurements can you find the bag with faulty balls and which bag contains it.
Given an array of integers, return true if there are contiguous numbers such that they add up to a specific target. For eg: [6,1,2,3,3,7] target sum is 8, will return true because 2,3,3 adds up to 8 and are contiguous. [6,1,2,4,3,3,7] will return false as there are no contiguous elements which adds up to 8.
How would you implement a game that you throw five dices and the values are in an array and return true if the array has 4 consecutive number
Given a list of denominations (e.g., [ 1, 2, 5 ] means you have coins worth $1, $2, and $5) and a number k, find all possible combinations, if any, of coins in the given denominations that add up to k, including repeats.
Simple OOPs question, a BFS problem, elementary number theory problem
Convert a tree to a doubly linked list.
Given a string A and B return true if A occurs as an anagram in B
Given an array push all non zero elements to the end
1. merge two sorted arrays together 2. given a m * n grids, and one is allowed to move up or right, find the number of paths between two grids.
a telephone keypad has letters associated with each number (e.g. 2 = abc, 3 = def); given a passphrase of "fb1" (e.g. one that you might use to log into a bank account), come up with an algorithm that would assemble an array that contains all the different possible letter combinations that, when typed into a telephone dial pad, would be equivalent to the original passphrase.
Viewing 2001 - 2010 interview questions