title: finding if two words are anagrams of each other
body: <p>I am looking for a method to find if two strings are anagrams of one another.</p>
  
  <pre><code>Ex: string1 - abcde
  string2 - abced
  Ans = true
  Ex: string1 - abcde
  string2 - abcfed
  Ans = false
  </code></pre>
  
  <p>the solution i came up with so for is to sort both the strings and compare each character from both strings till the end of either strings.It would be O(logn).I am looking for some other efficient method which doesn't change the 2 strings being compared</p>