Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 664. Strange Printer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source