You are given an array of n numbers and each element is equal to the count of numbers less than that number in right hand side of the original and we have to find the original array; It is given that the n-numbers in the original array is from 1 to n.
For ex. if the original array is 4,1,3,2 Then we would we given the array 3,0,1,0 Ex no 2. Original array 2,3,1,4 Given array 1,1,0,0 Ex no. 3 original array 5, 2,1,3,4 Given array 4, 1,0,0,0 Can any one suggest space and time efficient solution for this. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
