anagram checker solved

[maradiloreto]

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

I defined a function for an anagram checker, considering word sorting and if it is case-sensitive.

What did you learn from the changes you have made?

I learned how to apply the sorted function for words with the same letters and the "noot" boolean operator to invert the truth value.

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

First, I considered using the "print" function, then chose "return" to combine the == equality operator.

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

The challenge was filtering all the functions learned in class into one assignment. Thankfully, one of the "hints" from the professor helped me solve the assignment ;)

How were these changes tested?

I tested my code on VS using SHIFT+return and discussing similar approaches with another student.

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

N/A

Checklist

• I can confirm that my changes are working as intended

[pedram-aliniaye-asli]

You did a great job here!
Please go ahead and close this pull request now. Thanks!