Data Structures, Algorithms, Leetcode, Segment Tree, Programming.
to appreciate the charm of data structures. This article is the first in this series. Problem description The minimum absolute difference of an array a is defined as the minimum value of |a[i] - a[j]|, where 0 <= i < j < a.length and a[i] != a[j]. If all elements of a are the same, the minimum