Key Takeaways:
When range is small → HashSet + loop is clean & fast
When range is huge → sorting + adjacent diff might be better
Always use min/max given in problem (they exist!)
What’s your favorite way to solve this? HashSet or sort?
#Array#HashSet