Available question text
Given sorted prize positions on a line, choose two integer segments of length k to maximize the number of distinct prizes covered (segments may overlap). The core approach is sliding-window / two-pointers to count prizes per k-length window and combine those counts with prefix/suffix maxima to pick the best pair efficiently.
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 2555. Maximize Win From Two Segments
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source