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.