- Problems - Given a non-empty array of integers let us say as num, find that unique element which appears only once.
- Condition - Time Complexity is O(n) and Space Complexity is O(1)
- Solutions - First sort the array then traverse the array and check whether the current element is equal to the adjacent element, if yes then move forward else return the statement.