CareerCup

Sort both words and check if they are same.

Take an int array of same size.
1- increment the array value for each caharacter at the ascii index value of each character.
2- reduce the value for the next array.
3- incase we have a +ve or -ve value for any index... its not an anagram.

give the algorithm for checking anagram => Do you mean ...an algo to say whether 2 words are anagrams or not ? OR
Generate all the possible anagrams for a given word ?

One Can only Generate permutations for words/sentences , but i dont think its possible to generate anagrams by writing a program for a given word/sentence ( unless & otherwise there is a huge database of meaningful words which you have to search ), so the question should be given two words , just check whether they are anagrams or not ..

Sorting would take more time i.e O(NlogN).

Having a separate array of size => char set size. apply the logic of "NEEL".
This would take O(N).