I applied online after talking to some recruiters at a university career fair and got a phone interview.

The phone interview had a generic problem-solving question along with a simple coding question.

After the phone interview, there were three rounds of on-site interviews with members from various teams and lunch with the interviewers afterwards.

Each round asked about prior projects/experience and then some coding questions. At the end of each round, the interviewers opened themselves up for questions about the company and the work experience there.

Given a list of words, output buckets for the set of words that are anagrams of each other. For example, given the list of words {foo, ofo, bar}, return two lists containing {foo, ofo} and {bar}.