This repository mainly has two working classes Part1 and Part2
-
Part1 has a method countWays(int n) which will count all the possible combinations of making the sum n using coins [1, 2, 5, 10, 20, 25, 50, 100, 200]
-
Part2 takes an input csv file and prints the next combination of possibilities using a helper class InputProcessor
Time complexity of both the classes is O(mn) where n is the sum to be made and m is the total coins that can be used (8 here).