You can find this article and more on Launch School’s Medium Publication.
You have just finished reading your first programming book and somebody has asked you to solve the following problem:
Write a program that finds all the words in the english language (anagrams) that can be formed by using the letters in a given string.
There are a number of ways that you can approach this problem. Depending on how quickly you need the program to finish, you may prefer one approach over another. For the sake of simplicity, and since you’re only a beginner, let’s assume that you don’t have any time or space constraints; you can go with a naive approach.