Leetcode 2555. Maximize Win From Two Segments

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.