Status: New grad, MS CS
Position: New grad at Amazon (applied through portal)
OA - Passed. Asked to schedule interview
Onsite (3 rounds):
1.) 1 behavioural + Topological sort (give order of dependency for imports)
2.) 1 behavioural +
Given logs of site visits of users. Find top k most popular hops.
User 1: Page A
User 2: Page A
User 2: Page B
User 1: Page B
User 2: Page B
User 2: Page C
As seen from the logs 2 users hopped from Page A to Page B hence:
Top 1: Page A -> Page B3.)1 behavioural +
https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/
Comments (0)