Available question text
Given a binary array where playing a level gives +1 for 1 and -1 for 0, find the minimum number of initial levels Alice must play (at least 1 and leaving at least one for Bob) so her prefix score exceeds Bob's suffix score. This reduces to finding the smallest prefix length k with 2*prefix_sum > total_sum (return -1 if none).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3096. Minimum Levels to Gain More Points
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source