# Longest Uncommon Subsequence I: Interview Notes

Longest Uncommon Subsequence I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For two strings, the longest uncommon subsequence is the longer string if they differ, or -1 if they are equal (a string is not a subsequence of a different longer/unequal string of the same characters? — if they are unequal, the longer one cannot be a subsequence of the shorter, and if same length and unequal neither is a subsequence of the other).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Computing a true LCS and returning n - LCS (that is not what this easy version asks).

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview assistant.