Jumping Numbers Problem Statement

Given a positive integer N, your task is to find and display all jumping numbers that are less than or equal to N.

A number is termed a jumping number if every adjacent digit within it differs by 1. All single-digit numbers are inherently deemed jumping numbers.

Note:

The difference between ‘9’ and ‘0’ is not considered as 1.

Example:

Input:

N = 25

Output:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23

Explanation:

For N = 25, the jumping numbers are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23. In these numbers, every pair of adjacent digits differ by 1.

Constraints:

• 1 <= T <= 100
• 1 <= N <= 10^8
• Time Limit: 1 sec