I applied through a recruiter and had one phone interview. The interview started with basic time complexity questions for different data structures. Then, I was asked one algorithm question regarding lists of anagrams, which I could not answer.

A couple of weeks later, my recruiter notified me of my candidature being rejected.

The question was: Given a paragraph of English text, output groups of words, one group per line. Each group represents words that are anagrams of each other and consists of the anagrams in lexicographically sorted order. The groups on different lines are also sorted in lexicographical order with respect to each other.