##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Three approaches
Approach 1 (Brute Force): Compare every pair. Time: , Space: .
Approach 2 (Sorting): Sort then check adjacent elements. Time: , Space: or depending on sort.
Approach 3 (Hash Set): Add elements to a set, check for duplicates. Time: , Space: . The hash set trades space for better time.
