The first round was a HackerRank challenge, followed by a phone interview. The process was smooth, and the recruiters were helpful and replied quickly. The problems were pretty easy.

The HackerRank challenge was a simple hashmap question. It required calculating the average of values and then displaying those values greater than the average.

Given a list of business names, return k results sorted according to the index value of a given search term. The constraint was that the search term must appear at the beginning of a word within a string. Therefore, the sorting had to be done according to the index of the word that starts with the search term.