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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1226. The Dining Philosophers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact