Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.