Interviewed for E6 ML-SWE.

Coding round 1:

1. k points closest to origin
   https://leetcode.com/problems/k-closest-points-to-origin
2. Variants of two sum problem
   https://leetcode.com/problems/subarray-sum-equals-k
   (Had to return if sum exists and length of larget sub-sequence that sums to K).

Coding round 2:

1. k-th largest element
   https://leetcode.com/problems/kth-largest-element-in-an-array
   variant: return index instead of number
2. A non LC problem. Given a 16 bit integer issue a token. Once a token is returned, the smallest token returned should be issued the next time. Handle edge cases.

System Design:

1. Design instagram video feed. (end to end)
2. Design Feed ranking for FB (focus on second stage ranker).

Behavioural:
Conflict resolution, pivoting etc

Result: Down level to E5. Passing on it since I have other opportunities (both tech and finance).