ATM Denomination

I used Euclid's Algorithm as inspiration for finding the calculation of the greatest common divisor, and arrays, and I came to O(n) time complexity and O(n) space complexity. For any suggestions let me know