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.
Find the minimum window in string S which will contain all the characters in string T
Create copy of LinkedList
Find the minimum distance to a leaf node in a binary tree
Describe a team project or team work
Data Structures, system design
Some of the questions were vague yet i could tell they were looking for something specific. Didn't come right out and ask.
HashMaps, storage/time tradeoffs, streams, etc.
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.
Q1. Describe 2NF Q2. What are the interfaces in linked list Q3. How different is the previous question from dynamic arrays
Viewing 831 - 840 interview questions