I gave the assessment last week for SDE 1.
previous exp: 2 year, service based MNC
platform: Hackerrank

Question: K Closest Points to Origin
https://leetcode.com/problems/k-closest-points-to-origin/

I could solve it by using min heap and keeping calculated distances in sorted order. Then just pop out the elements as per K value.
This solution passed all the test cases.

Second ques: https://leetcode.com/discuss/interview-question/1459915/Amazon-or-OA-or-Prime-air-time

Pls pray that I get the call.

All the best! :)