Leetcode 38. Count and Say

Generate the nth term of the "count-and-say" sequence by repeatedly applying run-length encoding to the previous term (starting from "1"), where each step converts consecutive identical digits into a count followed by the digit. The core challenge is efficient string processing of consecutive runs (1 ≤ n ≤ 30 makes iterative simulation sufficient).