A 3-round loop process with data structures and algorithms and basic OOP concepts and DBMS concepts and Amazon leadership principles interview and a HR interview and basic low-level design and online Assessment
Interview questions [1]
Question 1
You are part of a university admissions office and need to keep track of the kth highest test score from applicants in real-time. This helps to determine cut-off marks for interviews and admissions dynamically as new applicants submit their scores.
You are tasked to implement a class which, for a given integer k, maintains a stream of test scores and continuously returns the kth highest test score after a new score has been submitted. More specifically, we are looking for the kth highest score in the sorted list of all scores.
Implement the KthLargest class:
KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of test scores nums.
int add(int val) Adds a new test score val to the stream and returns the element representing the kth largest element in the pool of test scores so far.
Example 1:
Input:
["KthLargest", "add", "add", "add", "add", "add"]
[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
Output: [null, 4, 5, 5, 8, 8]
Interview includes 2 coding rounds, 1 system design round, and STAR-based behavioral questions. Focus on DSA, especially graphs and trees. Also prepare Gmail filtering, timestamp-based filtering, and related implementation concepts.
Interview questions [1]
Question 1
Graphs trees star based questions filtering of emails and timestamps
I attended an SDE 1 interview at Amazon. The interviewer focused on data structures, algorithms, and problem-solving. I explained my approach clearly, optimized my solution, answered behavioral questions, and gained valuable interview experience.