CareerCup

Hash the first char array which will take into account number of occurrence of every character.
Hash the second char array. and reduce the value of hash{character} by 1.
Iterate thru the entire hash and if any negative value occurs then return false else true.

Use a bit vector. Increment/Decrement stuff.

bit vector is a better option...which you can use off the shelf...

bit vector is a better option...which you can use off the shelf...

use counting sort (O(n)) and then run length encoding into string O(n) and string compare each sting O(n). hence O(3n) equal to O(n).

use counting sort (O(n)) and then run length encoding into string O(n) and string compare each sting O(n). hence O(3n) equal to O(n).

use counting sort (O(n)) and then run length encoding into string O(n) and string compare each sting O(n). hence O(3n) equal to O(n).

@ nerd and @ wat abt on August 11, 2009
repeating your answer 3 times does not mean it is THE answer, so do not do that please. thank you !

Initialize an array of 256 integers to 0.
Traverse pa and populate array with count of each character.
Traverse pb:
For each character in pb:
If count of the character is <=0 return false
Else decrement count of the character in the temp array.
return true

Initialize an array of 256 integers to 0.
Traverse pa and populate array with count of each character.
Traverse pb:
For each character in pb:
If count of the character is <=0 return false
Else decrement count of the character in the temp array.
return true

Initialize an array of 256 integers to 0.
Traverse pa and populate array with count of each character.
Traverse pb:
For each character in pb:
If count of the character is <=0 return false
Else decrement count of the character in the temp array.
return true