Change to "Given an unsorted array, find the MINIMUM difference between the successive elements in its sorted form."
Is there any linear algorithm for above problem?

Yes if you believe radix sort is linear. I couldn't think of an algorithm similar to what's presented in the solution (i.e. bucket sort), but maybe someone can come up with one.