Flip game winner
Two players alternate turns on a string of '+' and '-' characters. On a move a player flips two consecutive '++' into '--'. A player who cannot move loses. Given the starting string `s`, return true if the player to move first can guarantee a win with optimal play. 1 <= len(s) <= 18.
Implement
can_win(s: str) → boolExamples
in
["++++"]outtrueWhat 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 30 min
solution.py
InputExpectedGot
["++++"]truenot run yetsample