Leetcode 1531. String Compression II

Given a string s and integer k, delete up to k characters to minimize the length of its run-length encoding; the core challenge is choosing deletions that merge runs or avoid count-digit increases. This is typically solved with dynamic programming that balances deletions used, current run character/count, and remaining string.