A string can be abbreviated by replacing any number of non-adjacent, non-empty substrings with their respective lengths. The numeric replacements must not contain leading zeros.

Given a string word and an abbreviation abbr, determine whether abbr is a valid abbreviation of word.

The abbreviation abbr consists of lowercase English letters and numeric values. Each numeric value in abbr represents the number of characters skipped in word. Letters in abbr must match the corresponding characters in word exactly. The abbreviation is valid if and only if it fully accounts for every character in word from left to right with no characters remaining or missing.

Note: A numeric value in abbr must not have leading zeros (e.g., "01" is invalid). A value of "0" is also invalid since it would represent replacing an empty substring.

Constraints:

• $1 \leq$ word.length $\leq 20$

• word consists of only lowercase English letters.

• $1 \leq$ abbr.length $\leq 10$

• abbr consists of lowercase English letters and digits.

• All integers in abbr will fit in a $32$-bit integer.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.