Longest Palindromic Subsequence After at Most K Operations

Longest Special Path

Longest Special Path II

Longest Subsequence With Decreasing Adjacent Difference

Make Array Non-decreasing

Manhattan Distances of All Arrangements of Pieces

Maximize Active Section with Trade I

Maximize Active Section with Trade II

Maximize Amount After Two Days of Conversions

Maximize Subarray Sum After Removing All Occurrences of One Element