https://leetcode.com/problems/house-robber/submissions/

Solution.kt

class Solution {
    fun rob(nums: IntArray): Int {
        val nhouses = nums.size
        val cache = HashMap<Int, Int>()
        fun search(h: Int) : Int {
        if (h >= nhouses) { return 0 } // No more house
            if (!cache.contains(h)) {
                cache[h] = nums[h] + (((h + 2) until nhouses).map { search(it) }.max() ?: 0)
            }
            
            return cache[h]!!
        }
        
        return (0 until nhouses).map { search(it) }.max()!!
    }
}