Minimize run-length encoded length with deletions

Problem

You are given a string s (uppercase English letters) and an integer k.

You may delete at most k characters from s. After deletions, you compress the resulting string using run-length encoding (RLE):

• Consecutive equal characters are replaced by the character followed by the run length only if the run length > 1 .
• Examples:
  • "A" -> "A"
  • "AA" -> "A2"
  • "AAA" -> "A3"
  • "AABCCC" -> "A2BC3"

Task

Return the minimum possible length of the RLE-compressed string after deleting at most k characters.

Input / Output

• Input: string s , integer k
• Output: integer (minimum compressed length)

Constraints (typical interview bounds)

• 1 <= len(s) <= 100
• 0 <= k <= len(s)

Clarifications

• The “length” is the number of characters in the encoded string (e.g., "A12" has length 3).