NeetCode #698LC-1406Hard1-D Dynamic ProgrammingNC 250
← Back to All Problems#698 · #1406 · Stone Game III(石子游戏 III)
📌 Problem Statement & Constraints
Alice and Bob play with a row of stones
stoneValue. Starting with Alice, each player takes 1, 2, or 3 stones from the front and adds their values to that player's score; both play optimally. Return "Alice", "Bob", or "Tie". Constraints: 1 <= stoneValue.length <= 5 * 10^4, -1000 <= stoneValue[i] <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!