Problem 3472 · Medium

Longest Palindromic Subsequence After at Most K Operations

Interval DP over the string with a remaining operation budget, pairing outer characters at their cyclic alphabet distance.

Open the interactive visualisation