Coin sums problem recursively in JS

coin sums problem

;
//Project Euler Problem #4 - Largest Palindrome Product
(function (exports) {
  "use strict";

  var coins = [1,2,5,10,20,50,100,200];

  exports.change = function (money,i) {
    if (money === 1 || money ===0) return 1;
    if (i <0) return 0;

    if (typeof i ==='undefined') i = coins.length-1;
    if (coins[i] > money) return exports.change(money, i-1);
    // console.log(money, i);
    return exports.change(money-coins[i], i) + exports.change(money, i-1);
  };

}(global));


console.log(change(200));