how to get the difference between 0 times rotated array and n times rotated array where n is length of array?
Simply: you can’t
The problem is to find the minimal number of rotations.
Your answer can be a number from 0 to n-1.
If an array would be rotated n (or more) times, it would wrap around, and you wouldn’t be able to know it just by looking at it.