Counters speedy solution for Verify Anagrams by Renelvon - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Counters solution in Speedy category for Verify Anagrams by Renelvon

from collections import Counter
import string

letters = lambda s: Counter(c for c in s.upper() if c.isalpha())
verify_anagrams = lambda s1, s2: letters(s1) == letters(s2)

May 16, 2014

Comments:

dgriffin91 on May 22, 2016, 7:59 a.m.
<p>After doing some benchmarking, this solution seems to be quite slow. On my computer this is 6x faster:</p> <pre class='brush: python'>def verify_anagrams(a, b): return sorted(a.replace(" ", "").lower()) == sorted(b.replace(" ", "").lower()) </pre>

dannystaple on Nov. 16, 2016, 11:27 p.m.
<p>My guess is that for all but a very very long anagram, the import is probably the slowest part.</p>

Look up in the Dict()

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.