Questions :

1. Given an array of integers, print out an array where at each index i, the total distance from i to every other duplicate element of i in the array is shown. For example, if the array was [1,3,1,1,2], the answer would be: [5,0,3,4,0].

2. Given an array of distinct integers, you may sort it by moving any element to the end of the array. Find the minimum number of moves to sort the array.

3. Task: Determine the count of how many such sequences of heights exist such that they satisfy the opinions of all of your friends. Since the result can be large, output it modulo 10^9 + 7.

4. Given N horizontal bars (numbered 1,2,...,N) and M vertical bars (1,2,...,M). There are list of X horizontal bars and Y vertical bars given which needs to be removed. After removal of given list of bars, we need to return the maximum gap which has been formed.

5. Find maximum value of k such that each kXk submatrix has sum less than or equal to givenSum.

Thanks for all the response will help fellow leetcoders to learn and improve