anagram

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. 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. generate a prime number array[26] each prime number represent a character, then when you traverse the string, multiple each character's prime number, if equal, it is anagrams, otherwise not. it takes O(n) and constant space There are couple of ways to solve it

I have a pool of characters and I want to match all the words which are anagrams of those chars or of a subset of those chars using a regular expression. Example: given the string "ACNE" the regex should give me these results: ACNE [T] CENA [T] CAN [T] CAAN [F] CANEN [F] I've tried this solution /b[acne]{1,4}/b but it accepts multiple repetitions of single chars. What can I do to take each char at most one time? The sub-anagrams of the word "acne" are the words that consist only of the letters acne do not contain a more than once do not contain c more than once do not contain n more than once

Given a string array， return all groups of strings that are anagrams. My solutions: For each string word in the array, sort it O(m lg m), m is the average length of a word. Build up a hash Table < string, list >. Put the sorted word into the hash table as key and also generate all permutations (O(m!)) of the word, search each permutation in a dictionary (a prefix tree map) with O(m), if it is in the dictionary, put (O(1)) it into the hash table so that all permutated words are put into the list with the same key. Totally, O(n * m * lg m * m!) time and O(n* m!) space , n is the size of the

I have been searching the internet for awhile now for steps to find all the anagrams of a string (word) (i.e. Team produces the word tame) using a hashtable and a trie. All I have found here on SO is to verify 2 words are anagrams. I would like to take it a step further and find an algorithm in english so that I can program it in Java. For example, Loop through all the characters. For each unique character insert into the hashtable. and so forth. I don't want a complete program. Yes, I am practicing for an interview. If this question comes up then I will know it and know how to explain it not

Which is the best way of generating anagrams for a text(maximum 80 characters length). Example: Input: dog output dog dgo odg ogd gdo god I'm only thinking of a backtracking solution, but that will take a while if the text is longer. Another thought is bulding i trie for all words in dictionary, but the problem doesn't ask for real words. Can somebody point out a minimum time complexity solution? Thank you! The question looks like generating the list of permutations; (Anagrams are a subset of permutations, which form a meaningful word). n! Permutations can be generated in chronological order

Forgive me if my code is off. I've still got my head in Ruby on Rails which seems to have subtle differences that are coming out as I learn more "just Ruby," although to be fair I'm not sure my code would pass muster in a Ruby on Rails format. I digress. I am trying to compare two arrays that contain a set of strings. I want to do a couple things. 1) Ensure that the arrays are the same number of words, otherwise the exercise is moot. 2) Compare the first word in an array with only the first word in the second array. In other words, I never want to compare word 1 in array "a" with word 4 in