Extra Characters in a String

Given a string s and a dictionary of words, choose non-overlapping substrings of s that are dictionary words to maximize covered characters (equivalently minimize the number of unused "extra" characters). The core challenge is selecting optimal matches across positions — typically solved with position-based dynamic programming often aided by trie/fast substring checks.