A stepping number is an integer where every pair of adjacent digits has an absolute difference of $1$.

Given two integers low and high, return a sorted list of all stepping numbers in the range $[$low, high$]$ inclusive.

Constraints:

• $0 \leq$ low $\leq$ high $\leq 2 \times 10^9$

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.