dot W_{\max})$ overall), we record only the right endpoint in a right array indexed by the start of the matc...

s every pair, but the optimal pair always has one endpoint at house 0 or house $n-1$. Suppose the best pair ...

Approach 1: Enumerate the Left Endpoint Intuition We can enumerate all substrings and che...

an store the length of each interval at its right endpoint. Specifically, we store $d[r]$ at the right endpo...

hin each group are sorted by non-decreasing right endpoint, the right endpoint $R$ only moves monotonically ...

t, consider the range of valid $j$. Fix the right endpoint $i$. As we extend the window leftward, the subarr...

rval. To do this efficiently, we record the right endpoint of every interval. Then, for each queried node, w...

a two-pointer algorithm, we can compute the left endpoint of the adjacent interval for every node. To facil...

select $k$ different subarrays. For a fixed left endpoint $l$, as the right endpoint $r$ increases, the max...

is balanced. Specifically: We enumerate the left endpoint $i$ of the substring and then enumerate the right...