Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Archive for July 2018

Calculate the number of ways of representing n cents

Problem Statement Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents) and pennies (1 cent), write code to calculate the number of ways of representing n cents Solution This is a recursive problem, so let’s figure out how to do makeChange(n) using prior solutions (i . . . Read more