##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Problem patterns
Use sets when you need:
Fast membership checks ($O(1)$ average)
Automatic duplicate removal
Union, intersection, or difference operations
Problems about unique elements or grouping
If the problem asks about common elements, missing elements, or unique elements, think sets first. Sets turn many $O(n^2)$ brute-force solutions into $O(n)$ solutions.
