Status: IN
sortString runs in O(n × 26) = O(n) time; each character is appended exactly once across all sweep iterations.
Source: entries/2026/06/06/increasing-decreasing-string-solution.md
JSON