Validate word abbreviation and reconcile two abbreviations
Overview
This question evaluates string parsing and pattern-matching competencies, including handling numeric tokens in abbreviations, reconciling ambiguous alignments between two abbreviation patterns, and reasoning about validation rules and edge cases within the Coding & Algorithms domain.
Implement a function isValidAbbreviation(word: string, abbr: string) that returns true if abbr is a valid abbreviation of word, where a positive integer in abbr represents the number of letters skipped and leading zeros are invalid. Follow-ups: (a) Given two abbreviations abbr1 and abbr2, determine whether there exists at least one original word (over lowercase letters) that both could represent; if so, return true and output one possible alignment of kept/skipped positions, otherwise return false. (b) Analyze time and space complexity, and discuss how you would handle very long inputs or streaming validation.