1. Kth largest number in an array. They do a lot of follow up. I gave him the perfect solution with min heap. Then he said if the K was large how to optimize space, I gave him solution with quickselect. Make sure to know time and space complexity well. 2. Valid binary search tree check. I have given him the solution with two range checking and recurrence. He told me to optimize with only one value.
Since the position is for new grad, the questions were about projects or thesis. Also, some basic knowledge about the position, like real-time system, which can be found in the qualifications. At last, there were some questions such as, what are the differences between study at university and in company; and why should we hire you.
Find frequency of words in files.
Binary Search Trees
Describe about your projects.
Are you familiar with our squad model?
Tree traversal question
LeetCode hard questions and behavioral questions based on amazon leadership principles .
Tell me about a time when you had to solve a challenging problem
LP: Learn, dive deep, have backbone, customer obsession... Coding: LRU cache; valid sudoku.
Viewing 491 - 500 interview questions