Problem Statement: Given an array arr[] and a number k . The array is sorted in a way that every element is at max k distance away from it sorted position. It means if we completely sort the array, then the index of the element can go from i - k to i + k where i is index in the given array. Our task is to completely sort the array.

They asked me a mix of array and greedy-based DSA questions to test my problem-solving approach, and also presented corporate situations where I had to explain how I would handle them effectively, balancing logic with practical decision-making.