about summary refs log tree commit diff
path: root/lisp
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-03-31T13·43+0100
committerWilliam Carroll <wpcarro@gmail.com>2020-03-31T13·43+0100
commitb2849682d3963f98d1d82c21f795d2905b985a8b (patch)
tree4b9d3674ce13dd20a5f7e41f2174d7ea1a405303 /lisp
parent3550fb34529dc16a61bc447a95b1e2b24138c2e6 (diff)
Progress with InterviewCake's coin problem
I'm writing a function that returns the total number of ways a cashier can make
change given the `amount` of change that the customer needs and an array of
`coins` from which to create the change.

My solution conceptually works but it actually does not return the results I am
expecting because I cannot create a Set of Map<A, B> in JavaScript. I'm also
somewhat sure that InterviewCake is expecting a less computationally expensive
answer.
Diffstat (limited to 'lisp')
0 files changed, 0 insertions, 0 deletions