Nim game winner
In a game of Nim there are several piles of stones given by `piles`. Players alternate; on a turn a player removes any positive number of stones from exactly one pile. The player who cannot move (faces all-empty piles) loses. Assuming both play optimally and the first player moves first, return True if the first player wins.
Implement
nim_first_player_wins(piles: list[int]) → boolExamples
in
[[1,2,3]]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 20 min
solution.py
InputExpectedGot
[[1,2,3]]falsenot run yetsample