Anagram Check: Algorithm with Unicode

A Programming and Interview Preparation Class by Edaqa Mortoray

How do you check if two strings are anagrams of each other?

In this class I take a look at this classic interview question. You'll learn how to solve the basic version, but I'll go deeper and show you improvements for foreign languages and unicode.

I've provided source code, in annotated Python, for all of the algorithms I discuss. The latter half of the course walks through the code, explaining the decisions I've made.

Source Code:

🎓 Levels: Intermediate
Basic coding experience in any language required

⏱ Running Time: 24m

Enroll on SkillShare

Edaqa is an avid teacher with many years of experience in programming and animation. Join the thousands of people who have already benefited from his writing, live streams, and videos.