Status: IN
Longest Uncommon Subsequence I collapses to a string equality check: if strings differ, return `max(len(a), len(b))`; if equal, return `-1` — no subsequence enumeration needed.
Source: entries/2026/06/06/longest-uncommon-subsequence-i-solution.md