Leetcode 527. Word Abbreviation

Given a list of words, generate the shortest unique abbreviation for each word of the form prefix + count of omitted middle letters + last letter (or keep the full word if abbreviation isn't shorter), resolving conflicts by expanding the shared prefix until every abbreviation is unique. The core challenge is grouping conflicting words and efficiently finding the minimal prefix length (often via grouping or a trie) needed to make each abbreviation distinct.