String Compression II

HardDynamic Programming2d dp

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

Run-length encoding replaces each maximal run of the same character with the character followed by the run length. A run of length 1 is written as just the character (no 1), so "aabccc" becomes "a2bc3" (length 5), and a run of 12 as becomes "a12" (length 3). Given a string s and an integer k, you may delete **at most** k characters from s (the rest keep their order). Return the minimum possible length of the run-length encoding of the resulting string. The encoded length of a run of c equal characters is 1 if c == 1, 2 for 2..9, 3 for 10..99, and 4 for 100.

Examples

Input: s = "aaabcccd", k = 2
Output: 4
Deleting "b" and "d" leaves "aaaccc", encoded as "a3c3".
Input: s = "aabbaa", k = 2
Output: 2
Deleting both "b"s leaves "aaaa", encoded as "a4".
Input: s = "aaaaaaaaaaa", k = 0
Output: 3
No deletions: "a11" has length 3.

Constraints

  • 1 <= s.length <= 100
  • 0 <= k <= s.length
  • s consists of lowercase English letters

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More 2d dp problems