What changes are you trying to make? (e.g. Adding or removing code, refactoring existing code, adding reports)

implementing an Anagram Checker function

What did you learn from the changes you have made?

how to sort characters in a string

Was there another approach you were thinking about making? If so, what approach(es) were you thinking of?

Create two sets from the characters of each string. If the sets are equal, it means the strings contain the same characters, just in different orders, and hence are anagrams of each other. Otherwise, they are not anagrams.

Were there any challenges? If so, what issue(s) did you face? How did you overcome it?

Understand the logic

How were these changes tested?

changes were tested by running the Anagram Checker function with various test cases

A reference to a related issue in your repository (if applicable)

@mentions of the person or team responsible for reviewing proposed changes (At least 2 people)

@michaeladrouillard
@juliagallucci

Checklist

• I can confirm that my changes are working as intended