Pizza With 3n Slices

Given a circular array of length 3n, choose exactly n slices to maximize their total such that picking any slice excludes its two neighbors (no two chosen slices can be adjacent, including across the ends). The core challenge is maximizing a fixed-number, non-adjacent selection on a circular array — typically tackled with dynamic programming by reducing to two linear cases.