Leetcode 2728. Count Houses in a Circular Street

Given a circular street represented by an array of houses, count how many houses satisfy a local property that depends on their neighbors (e.g., empty/available, isolated, or collectible). The core challenge is correctly handling circular adjacency (wrap-around) and evaluating the local predicate for each house, typically achievable in a single O(n) pass.