Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **arr** of size **n**. Print all the numbers less than **k**andshould be such that the difference between every adjacent digit should be **1**in the array.

**Note: **Return empty list if no such number present, driver code will automatically print -1.

**Example 1:**

**Input:**n = 8, k = 54arr[] = {7, 98, 56, 43, 45, 23, 12, 8}**Output:** 43 45 23 12**Explanation:** 43 45 23 12all these numbers have adjacent digits diff as 1 and they areless than 54.

**Example 2:**

**Input:**n = 10, k = 1000arr[] = {87, 89, 45, 235, 465, 765, 123, 987, 499, 655}**Output:** 87 89 45 765 123 987

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function**getDigitDiff1AndLessK()**which takes the array of integers**arr, n**and**k**as parameters and returns a list of integerdenoting the answer.

**Expected Time Complexity:**O(n)**Expected Auxiliary Space:**O(1)

**Constraints:**

1 <= n <= 10^{7}

1 <= k, arr[i] <= 10^{18}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Absolute Difference of 1

...