?

Log in

No account? Create an account

Inteviews, Pt2

Apr. 3rd, 2004 | 05:00 pm

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.

Link | Leave a comment | Share

Inteviews, Pt2

Apr. 3rd, 2004 | 05:00 pm

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.

Link | Leave a comment | Share