4 ms·

I don't see how the sum would be unique to a particular combination of letters.

• LyndsySimon 8y ago
  “ad” = “bc” You’re right.
• jcadam 8y ago
  I briefly mused about just summing the ASCII codes for each letter in the strings. But quickly discarded the idea for this reason :)
• tylerhou 8y ago
  Works if you assign prime numbers to each letter and multiply instead. So a=2, b=3, etc.
  • tuukkah 8y ago
    To get decent anagram lengths and complexity, implement the numbers as a dict of repetitions of primes, and implement the multiplication by summing the repetitions. ;-)
    • reinhardt 8y ago
      In which case you can just compare the dicts without performing the multiplication (which happens to be the costliest part for arbitrary-precision integers).
      • tuukkah 8y ago
        Exactly.
• deleted 8y ago
  [deleted]
• deleted 8y ago
  [deleted]
• D_Alex 8y ago
  What if a=1, b=10, c=100 - etc? Assuming the strings were English words...