SDE - 1

You are given an array “ARR” of 'N' integers and an integer 'K'. You can move from any index 'i' to index 'j' if j ≤ i + K. The cost of moving from one index 'i' to the other index 'j' is abs(ARR[j] – ARR[i]). Your task is to find the minimum cost to reach the end of the array from the beginning of the array when a maximum jump of 'K' is allowed.

For example:

If the given array is [10, 3, 40, 5, 25] and K is 2 then the minimum cost would be 29. 
Since K = 2, the optimal way to reach the end of the array with minimum cost is to take a jump to 1st index from 0th index with the cost of abs(3 - 10)  i.e 7 and then we take a jump of 2 from 1st index to the 3rd index with the cost of abs(5 - 3). i.e 2. Then we take a jump of 1 from 3rd index to the last index with the cost of abs(25 - 5) .ie 20. 
Therefore the minimum cost to reach the end of the array is (7 + 2 + 20) i.e 29.

TO design Data structure to carry two stack operations at once. (Input will be stack1 , push, 4) or (stack2, pop) or(stack1, showVaueOnTop())..

Design data structure to insert, delete, getRandom in O(1) time.

Given a list of cities numbered from 0 to N-1 and a matrix 'DISTANCE' consisting of 'N' rows and 'N' columns denoting the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the starting city?

Design basic API to catch user mobile usage patterns.