Encode String with Shortest Length

Given a string, produce its shortest encoded form using the k[encoded_string] notation (allowing nested encodings) by replacing repeated substrings with counts. The core challenge is interval dynamic programming combined with efficient detection of repeated patterns (and choosing optimal splits/nesting) to minimize encoded length.