Leetcode Problem 213. House Robber II

213. House Robber II

Leetcode Solutions

Dynamic Programming Approach for Circular House Robber

  1. Check if the array nums has only one element, return that element as the result.
  2. Define a helper function rob_linear that takes a subarray of nums and returns the maximum amount of money that can be robbed from that subarray using dynamic programming.
  3. Call rob_linear on nums[1:] to solve the subproblem excluding the first house.
  4. Call rob_linear on nums[:-1] to solve the subproblem excluding the last house.
  5. Return the maximum of the two values obtained from step 3 and 4.
UML Thumbnail

Recursive Approach with Memoization for Circular House Robber

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...