Sat 3 Apr 2004
Inteviews, Pt2
at 5 pm
1 Comment
2nd question, for the techies:
Write a method called Anagram that determines whether two strings are anagrams of each other. Two words are anagrams if they contain the same characters in a different order (e.g. “general coding” is an anagram of “a reclined gong”). The method should return a boolean value.
Language doesn’t matter, pseudo code acceptable.
April 7th, 2004 at 1:55 pm
Post More Often, you Doofus!