You are given a string word consisting of digits and lowercase English letters.

Replace every non digit character with a space, then separate the remaining contiguous digit sequences into integers. Two integers are considered equal if they evaluate to the same decimal value after ignoring leading zeros.

Return the number of unique integers in word.

Constraints:

• $1 \le$ word.length $\le 1000$

• word consists of digits and lowercase English letters.

Now, 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.