Leetcode 1025. Divisor Game

Two players alternate replacing n with n − x for any proper divisor x of n; determine whether the first player can force a win under optimal play. Key observation (provable by simple DP/induction): Alice wins iff n is even.

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 1025. Divisor Game

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact