Solving the Anagram Algorithm

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. For example, the word anagram can be rearranged into nag a ram, or the word binary into brainy or the word ‘adobe’ into ‘abode’.

Algorithm problems are still very much a part of the job search.

The Anagram Algo is one case that comes a lot, without further ado let’s see it.

Write a function that takes two string and checks if they return an anagram.

So, we need to write a function that takes two strings and compare them, to see if they have the same letters, after comparing the two strings, the function will return a boolean, if it’s true, then it’s an anagram, otherwise, return false.

Happy coding…

Related posts:

Decidir tener un negocio propio conlleva una serie de exigencias y esfuerzos. Llevar a cabo la idea financiera de tus sueños no es imposible, siempre y cuando conozcas detalladamente las mejores…

2019 foi um ano horrível: fiquei até agosto desempregado e depois acabei aceitando um trabalho bem abaixo das expectativas que tinha na época em que deixei meu emprego anterior, mas claro, naquela…

The teachings of Ajahn Chah, a Medium series by Duong Chi