Count how often each letter appears instead of sorting or rescanning: anagrams share their 26 letter counts, so a hash map of counts groups them, and one counting pass finds the first letter that appears once in O(n) instead of O(n²).
This interactive visualization needs JavaScript.