Complexity Analysis

Time Complexity: O(N²), Two nested loops are used to compare elements, leading to quadratic time complexity.

Space Complexity: O(1), No additional data structures are used; space usage remains constant.

Better Approach

Algorithm

Sort the given array.
Iterate from 1st position to (n-2)th position(0-index).
If the previous element, current element and next element are totally different. It is a non-repeating element.
For edge cases, i.e, 0th and (n-1)th element. If the 0th element is not equal to the 1st element, then the 0th element is non-repeating. Similarly if (n-1)th element is not equal to (n-2)th element, (n-1)th element is non-repeating element.