Leetcode 524. Longest Word in Dictionary through Deleting

Given a string s and a list of words, return the longest word that is a subsequence of s (i.e., can be formed by deleting some characters); if multiple words tie, return the lexicographically smallest one, or an empty string if none qualify. Constraints (lengths up to ~1000) imply subsequence checks must be done efficiently across the dictionary.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 524. Longest Word in Dictionary through Deleting

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact