{"id":"lus-mathematical-reduction","text":"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.","truth_value":"IN","source":"entries/2026/06/06/longest-uncommon-subsequence-i-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"lus-mathematical-reduction","truth_value":"IN","reason":"premise"}]}}