<ul><li>Given an unsorted array, the output should be the minimum difference between the elements and the elements itself.</li><li>The problem can be solved by iterating through the array using two nested loops and calculating the absolute difference between each pair of elements.</li><li>The first solution has a time complexity of O(n^2) and involves comparing each pair of elements.</li><li>The second solution involves sorting the array first and then finding the minimum difference by comparing adjacent elements, with a time complexity of O(n log n).</li></ul>

Given an unsorted array, find the minimum difference between 2 elements.

Discover more