Leetcode 2753. Count Houses in a Circular Street II

Count the number of valid ways to choose or label houses arranged in a circle subject to local constraints (for example, restrictions on adjacent selections or coverage), where wrap-around adjacency makes the cycle nontrivial. Designing an efficient solution requires cycle-aware dynamic programming, combinatorics/inclusion–exclusion or matrix exponentiation and careful handling of large n and modular arithmetic.