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.