A professional robber plans to rob some houses along a street. These houses are arranged in a circle, which means that the first and the last house are neighbors. The robber cannot rob adjacent houses because they have security alarms installed. Following the constraints mentioned above and given an integer array money representing the amount of…

house-robber-II.js

function houseRobber(money) {
  return Math.max(
    calcMax(money, 0, money.length - 1),
    calcMax(money, 1, money.length)
  );
}

function calcMax(money, from, to) {
  const dp = [];
  for (let i = from; i < to; ++i) {
    dp[i] = Math.max(money[i] + (dp[i - 2] ?? 0), dp[i - 1] ?? 0);
  }
  return Math.max(...dp.filter((num) => num != null));
}

export { houseRobber };

// tc: O(n)
// sc: O(n) (can be improved to O(1) by using 2 variables instead of 2 arrays)