Anagram.md

<Title of the Problem>

Anagram

Problem Explanation 🚀

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.

Your logic 🤯

• Approach: Created two arrays to hold the string and compared the array one by one
• Own test cases if any
• Code Structure and Libraries used

Time Complexity and Space Complexity

Example 

Time Complexity -> O(n^2)
Space Complexity -> O(1)