Solved Anagram Problem
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
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.
Problem Explanation
We can consider two strings as anagrams, if they have the same characters, and each character occurs with the same frequency. Hence, the problem can be solved by maintaining the frequency of characters.
Type of change
[x] New feature (non-breaking change which adds functionality)
[x] Breaking change (fix or feature that would cause existing functionality to not work as expected)
Checklist:
[x] My code follows the style guidelines of this project
[x] I have made corresponding changes to the documentation
[x] I have added tests that prove my fix is effective or that my feature works
name: ''Soumyaranjan" about: '' title: ''Anagram" labels: hacktoberfest assignees: ''
Description
Solved Anagram Problem Given two strings s and t, return true if t is an anagram of s, and false otherwise.
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.
Problem Explanation
We can consider two strings as anagrams, if they have the same characters, and each character occurs with the same frequency. Hence, the problem can be solved by maintaining the frequency of characters.
Type of change
Checklist: