I applied through Linkedin for the above role and after the initial HR chat they arranged for a 1 hour technical phone interview.
First 15 minutes we talked about my experience and about the team. Then they gave this problem in HackerRank. It is another version of https://leetcode.com/problems/top-k-frequent-words/
We get a list of stocks (eg: MSFT|1000, FACEBOOK|700, MSFT|700, AMAZON|450 etc.) we need to return the top k stocks after combining their values. Eg if k =2 then output will be (MSFT|1700, FACEBOOK|700)
I did come up with the solution same as the one given in Leetcode O(n log n) and the interviewers seemed happy with the solution.
So absolutely no idea why I was rejected :)