Uber Phone Screen | US | Sr. MLE | Accept
Anonymous User
1321

I gave phone screen in Nov. 2021.

I was asked this question

  1. https://leetcode.com/problems/top-k-frequent-words/
    The input was a long string containing several words.
    I presented solution with TC: O(NlogK)

  2. What if special chars and punctuations are present?

  3. The input is stored on a disk across several files. It cannot be loaded in-memory. What modifications will have to be done? What is the new time complexity.

Comments (5)