Bloomberg L.P.

  www.bloomberg.com
Work in HR? Unlock Free Profile

Bloomberg L.P. Financial Software Engineer Interview Question

I interviewed in New York, NY and was asked:
"You're given a set of strings. You want to test if any two strings in the set are anagrams."
Tags: data structures, algorithm
Add Tags [?]
Answer

Part of a Financial Software Engineer Interview Review - one of 1,754 Bloomberg L.P. Interview Reviews

Answers & Comments

0
of 0
votes

I gave a solution that involved sorting the strings and using that as elements of a new set to check for anagrams. They asked me to reduce the memory footprint of my solution without sacrificing the O(N) time (N = number of strings, we assumed that string lengths were O(1)). I suggested that if the strings represent words in a natural language, we might be able to apply the same Huffman encoding to everything in the set, which maybe could reduce space by, say, 50%. They seemed satisfied with that solution.

- Interview Candidate on Nov 3, 2011
0
of 0
votes

You could also check to see if the words have the same number of characters and same characters using a hash map. Only anagrams can satisfy that.

- Rio on Nov 14, 2011

To comment on this question, Sign In with Facebook or Sign Up

Tags are like keywords that help categorize interview questions that have something in common.