Refresh to get another 5 random questions
##
Making Change

##
A magic number of 9 digits

##
The color of the bear

##
Four ninja turtles

##
A game of N gamblers

You are given n types of coin denominations of values v(1) < v(2) < ... < v(n) (all integers). Assume v(1) = 1, so you can always make change for ...

Tags: algorithm dynamic_programming

Write an algorithm to find the 9 digit numbers without zeros containing distinct digits from 1 to 9 such that the number form up to to the nth digit is ...

If a bear walks one mile south, turns left and walks one mile to the east and then turns left again and walks one mile north and arrives at its ...

Tags: brainteaser microsoft

There are four ninja turtles/dogs/ants at four corners of a square of unit distance. At the same instant all of them start running with unit speed towards the person on ...

In a game of N gamblers, the ith gambler starts the game with a_i dollars. In each round, two gamblers selected at random make a fair bet, and the winner ...