Find if 2 strings are anagram in O(1) space and O(n) time

algorithm anagram
shreyasva picture shreyasva · Jul 11, 2011 · Viewed 8.9k times · Source

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.

Answer

NPSF3000 picture NPSF3000 · Jul 11, 2011

Absolutely no expert here...

But why not go through each string and simply count how many times each letter turns up.

Given appropriate implementation, this shouldn't take more than O(n) time.

Related questions

How to check if two words are anagrams

I have a program that shows you whether two words are anagrams of one another. There are a few examples that will not work properly and I would appreciate any help, although if it were not advanced that would be …

Read More
Finding anagrams for a given word

Two words are anagrams if one of them has exactly same characters as that of the another word. Example : Anagram & Nagaram are anagrams (case-insensitive). Now there are many questions similar to this . A couple of approaches to find whether …

Read More
Anagram algorithm in java

I would like to make anagram algorithm but This code doesn't work. Where is my fault ? For example des and sed is anagram but output is not anagram Meanwhile I have to use string method. not array. :) public static boolean …

Read More