In data structures practice, three types of house robber problems are designed, starting from an array, then a circular array and then a binary tree.
Below are links to those:
These problems started with easy level to medium. With one additional condition or with a change of data structure, solution or implementation changes entirely.
Not only solving of problems and also designing a problem is also a great art. Hats-off to these designers.
