Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.