solulubeta
Sign in
Story Problems / Dynamic programming
07.09 · Problem

Circular Street Robbery

Medium 1-D DP · reuse of the take/skip idea Pro

This problem is part of solulu Pro

The same thieves now visit a circular street: house 0 is next to the last house. Adjacent houses (including the first and last) share an alarm. What is the maximum cash they can rob?

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 83 of 94 · updated 2026-10-12