# Longest Word In Dictionary Through Deleting: Explained

Longest Word In Dictionary Through Deleting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find the longest dictionary word that is a subsequence of s (ties: lexicographically smallest). For each word, two-pointer check it is a subsequence; keep the best. Sorting the dictionary first makes the scan early-exit.

## 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(|dict| * |s|).

## Common mistake

Requiring a contiguous substring instead of a subsequence, or breaking ties toward the lexicographically largest word.

## 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 Linkjob.ai.