Menu

Close
  • Home
  • GitHub
  • Contacts
  • Project Euler
Subscribe
Menu

interview question

A 1-post collection

Page 1 of 1

Coin denomimation algorithm

Coin challenge

How many different ways can N be made using any number of denominators.

For example we have denominators list: [1,3,6]. So how many ways we can made number 4 with any numbers of [1,3,6].

Answer: [1,1,1,1], [3,1], [1,3].

»

Mijkenator on interview question, erlang, python 16 February 2016
Page 1 of 1
Mijkenator`s blog © 2016
Casper theme powered by Ghost