bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
EasyArrays & HashingLC 408

Valid Word Abbreviation

A string can be abbreviated by replacing any number of non-adjacent, non-empty substrings with their lengths. The lengths should not have leading zeros. For example, a string such as "substitution " could be abbreviated as (but not limited to): "s10n " ( "s ubstitutio n ") "sub4u4 " ( "sub stit u tion ") "12 " ( "substitution ") "su3i1u2on " ( "su bst i t u ti on ") "substitution " (no substrings replaced) The following are not valid abbreviations: "s55n " ( "s ubsti tutio n ", the replaced substrings are adjacent) "s010n " (has leading zeros) "s0ubstitution " (replaces an empty substring) Given a string word and an abbreviation abbr, return whether the string matches the given abbreviation.

Asked at 2 companies
FacebookGoogle
Hints
  • 1.Think about which data structure fits best
  • 2.Consider the time complexity of your approach
  • 3.Look for patterns in the constraints
LeetCode