InterviewDigestInterviewDigest

OA Practice Workspace

Technical2026-08-15

Given an integer array representing money in houses arranged in a circle where adjacent houses cannot be robbed, determine the maximum amount of money that can be stolen.

Context & Summary

The candidate was asked to solve a dynamic programming problem involving circular constraints.

💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.