Problem 1425 · Hard

Constrained Subsequence Sum

Find the largest total of a subsequence in which consecutive chosen indices are at most k apart. The visual shows a sliding maximum window over a DP array.

Open the interactive visualisation