One-liner creative solution for Verify Anagrams by nickie - python coding challenges

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

One-liner solution in Creative category for Verify Anagrams by nickie

verify_anagrams=lambda f,s,c=lambda w:sorted(w.lower().replace(' ','')):c(f)==c(s)

May 10, 2014

Comments:

veky on May 11, 2014, 7:13 p.m.
Argh. :-) Sorry. :-)

nickie on May 11, 2014, 9:43 p.m.
Well, I'm using single quotes, you're using double... Anyway, now I'm much more confident that it cannot be done in <80 characters. :-)

veky on May 12, 2014, 6:31 a.m.
<blockquote> Well, I'm using single quotes, you're using double... </blockquote> And I use k, you use c, though for the same thing (fonetically, kanonikal:). <blockquote> now I'm much more confident that it cannot be done in <80 characters. :-) </blockquote> Veky + nickie = Kolmogorov? :-D

StefanPochmann on April 26, 2015, 9:49 p.m.
<blockquote> <blockquote> now I’m much more confident that it cannot be done in <80 characters. :-) > Veky + nickie = Kolmogorov? :-D </blockquote> </blockquote> <a href="http://www.checkio.org/mission/verify-anagrams/publications/StefanPochmann/python-3/78/">No</a>

nickie on May 18, 2014, 10:10 a.m.
For the record, if the length of the strings is N, the one-liner takes O(N*logN) time to sort the characters in the strings. This is of course not optimal; the task can be easily solved in O(N), in one traversal.

bryukh on May 18, 2014, 9:06 p.m.
How about O(n) one-liner? ;-)

nickie on May 18, 2014, 9:40 p.m.
<a href="http://www.checkio.org/mission/verify-anagrams/publications/Renelvon/python-3/counters/">Renelvon's counters</a> (not sure, though, if he was the first to publish a solution with Counter) is IMHO the closest you can get to an O(n) one-liner: <pre class='brush: python'>verify_anagrams=lambda f,s,c=lambda w:__import__("collections").Counter(w.lower().replace(' ','')):c(f)==c(s) </pre> 107 characters...

bryukh on May 18, 2014, 10:42 a.m.
<blockquote> the task can be easily solved in O(N), in one traversal. </blockquote> Hm, interesting. I didn't think about this. Thank you tip-off what to do today evening :) Update: yep, I hoped this would take more time :-)

chzzz on May 22, 2014, 9:47 a.m.
nice

Look up in the Dict()

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!