Leetcode 320. Generalized Abbreviation

Generate all generalized abbreviations of a given word by replacing any subset of characters with counts that represent consecutive abbreviated letters. This is a combinatorial generation problem (2^n possibilities) best solved with backtracking or bitmask enumeration while collapsing adjacent abbreviated positions into numeric counts.