Predict the winner
Given an array 'nums' of integers, two players take turns picking a number from either end of the array, adding it to their score. Player 1 moves first; both play optimally to maximize their own score. Return True if Player 1 can end with a score greater than or equal to Player 2 (a tie counts as a Player-1 win), else False. 1 <= len(nums) <= 20, values may be negative.
Implement
predict_winner(nums: list[int]) → boolExamples
in
[[1,5,2]]outfalseWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,5,2]]falsenot run yetsample