Leetcode 1226. The Dining Philosophers

Coordinate five concurrent threads arranged in a ring that must each acquire two adjacent shared resources (forks) before calling the provided eat callback, ensuring mutual exclusion and a discipline that avoids deadlock and starvation. Implement wantsToEat(philosopher, pickLeftFork, pickRightFork, eat, putLeftFork, putRightFork) to safely pick both forks, eat, and release them.