Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1686. Stone Game VI
Two players alternately pick stones (Alice first) from n items where stone i gives aliceValues[i] to Alice and bobValues[i] to Bob; under optimal play, determine whether Alice wins (1), Bob wins (-1), or it's a draw (0). n can be up to 1e5, so an O(n log n) or better approach is required.
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.