You are given an array that represents bills in certain currency (For example 1, 2, 5, 10) and an amount, for example 17. You should output the number of possible combinations of bills that sum to the given amount. For example, {10, 5, 2} is valid combination, {10, 5, 1 ,1} also. I did not ask questions like does the order of bills matter, i.e. is {10, 5, 2} same as {2, 10, 5}.
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"
n= 20 for (i=0;i<n; i--) print i the question was to change or replace a only one character in for loop to print 20 times.
Find all duplicate files by content in your filesystem.
First Round: Write a pattern 1: Should accept only odd numbers numbers only except 2: Pattern should be fully Dynamic for n =1 @@@@@ * ** *** **** ***** ****** ***** **** *** ** * @@@@@ Second Round:n=6 * ** *** **** ****** ****** ***** **** *** ** *
1--a 2--b ... 26--z given a digit , return the count of the possible output eg. '1313' --- 4 acac mac mm acm '101' --1 ja cannot discard any digit .
Given set of coins and each coin has its unique probability to be head up, say double[] probs stores the probability values for all coins, print out all different cases and accordingly probability.
To return the 'm' smallest numbers from a file of 'n' numbers
Rand(7) from Rand(5)
Write a function that divides one number by another, without using the division operator, and make it better than O(n).
Viewing 351 - 360 interview questions