Search
⌘K
Get Premium
Leetcode 664. Strange Printer
Given a printer that in each turn prints a contiguous run of the same character and can overwrite existing characters, compute the minimum number of turns to print a target string s. The core challenge is to use interval dynamic programming to optimally merge equal characters (overlaps/overwrites) to minimize print operations.
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.