Problem 2968 · Hard

Apply Operations to Maximize Frequency Score

Spend at most k single-step changes, each adding or subtracting 1 from one array element, so that some value appears as many times as possible. Return that largest count.

Open the interactive visualisation