title: Find if 2 strings are anagram in O(1) space and O(n) time
body: <p>You can find if 2 strings are anagrams after sorting both strings in O(nlogn) time, however is it possible to find it in o(n) time and O(1) space.</p>