Problem Statement
Rotating Table Problem Problem Description There are three elements involved — dishes, seats, and customers — arranged on a rotating circular table. Each customer must have access to all dishes. The task is to find the minimum number of rotations required so that every customer can try every dish. (Focus: simulation / modular arithmetic / circular array manipulation)