Fix an Almost Sorted Array | Dataford Interview Questions

Fix an almost sorted array.

Asked in the Round 1 stage. The question was discussed after Android questions.

An array is k-almost sorted if every value is no more than k positions away from its position in the fully sorted array. Implement fix_almost_sorted(nums, k) and return the sorted array. Do not modify nums.

Constraints

0 <= len(nums) <= 1000
0 <= k <= len(nums)
Values are integers
The input satisfies the k-almost-sorted condition
The input array must not be modified

Function Signature

def fix_almost_sorted(nums, k):

Your question is Fix an Almost Sorted Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Fix an almost sorted array.

Asked in the Round 1 stage. The question was discussed after Android questions.

Constraints

0 <= len(nums) <= 1000
0 <= k <= len(nums)
Values are integers
The input satisfies the k-almost-sorted condition
The input array must not be modified

Function Signature

def fix_almost_sorted(nums, k):

Your question is Fix an Almost Sorted Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.