3003. Maximize the Number of Partitions After Operations

Given a string s and a number k. Partitioning: repeatedly take the longest prefix with ≤ k distinct characters, remove it (that's one part). Before starting, you may change at most one character to…