Dont know the error in code please tell

#1
#2

@Ramitgoel
Their is a better approach nLog(n).
We know everytime a number repeats, it is given a new hash value, which is equal to the number of distinct numbers occurred till now. So we can just store the last occurrences of all the numbers and assign the values incrementally, in increasing order of the positions of their last occurrences.

refer to this code : https://ide.codingblocks.com/s/234330
you can watch this video too