Search
⌘K
Get Premium
Leetcode 411. Minimum Unique Word Abbreviation
Given a target word and a dictionary, find the shortest abbreviation (letters kept + counts for omitted runs) of the target that cannot represent any dictionary word; this reduces to selecting positions to keep so that for every same-length dictionary word at least one kept position differs, solvable by filtering same-length words and searching bitmask patterns (with bit operations/pruning) for the minimum-length distinguishing mask.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.