What is the most Pythonic way to check if two strings are anagrams?

Problem Statement

Explanation

Anagrams have the same character counts. Counter compares frequency maps in linear time. Sorting also works but is O(n log n) and less direct. Comparing sets fails because it ignores frequencies. Reversing does not relate to anagrams.

Code Solution

SolutionRead Only

from collections import Counter

def is_anagram(a,b):
    return Counter(a) == Counter(b)

Practice Sets

This question appears in the following practice sets:

Interview Coding Patterns

Next Question

Master Interviews
Anywhere, Anytime

What is the most Pythonic way to check if two strings are anagrams?

Problem Statement

Explanation

Code Solution

Practice Sets

Related Questions

Is Python compiled, interpreted, or both?

Which of these joins two lists to make one new list?

Which loop runs until a condition becomes false?

Which method gives the floor value of a float?

In Python, what is the difference between '/' and '//'?

More from Python

Master Interviews Anywhere, Anytime

What is the most Pythonic way to check if two strings are anagrams?

Problem Statement

Explanation

Code Solution

Practice Sets

Related Questions

Is Python compiled, interpreted, or both?

Which of these joins two lists to make one new list?

Which loop runs until a condition becomes false?

Which method gives the floor value of a float?

In Python, what is the difference between '/' and '//'?

More from Python

Master Interviews
Anywhere, Anytime