Recently I attended the interview at Google and I was asked "You are given a sorted list of disjoint intervals and an interval, e.g. [(1, 5), (10, 15), (20, 25)] and (12, 27). Your task is to merge them into a sorted list of disjoint intervals: [(1, 5), (10, 27)]."
Designing DS for storing the incoming signals and querying
We went over my resume for a few minutes in the beginning, and we started the real technical interview. Nothing really unexpected. The only question we were able to go through was a question about BFS/DFS, basically traverse through a given 2D array map and find a path.
Build a function to determine if in a large text (Shakespeare's entire work) contains a sequence of characters
Arraylist and Strings manipulation.
NDA. You have to write a code (not pseudocode) on a whiteboard. I studied using leetcode and geeksforgeeks. Make sure you know your data structures and famous algorithms. Practice on your recursion. Have a good night sleep the night before your interview. 2 coding sample 1 phone interview - I had 2 questions 4 on-site interview - one questions each but was asked to improve my solution
Write an algorithm to create an ordered list from the union of ordered sublists. Write an algorithm to generate all unique possible letter racks in scrabble.
The recruiter wasn't even able to formulate a complete phrase
2-3 programs and more optimisation in that.
All interviews, except one, was coding, Easy/medium(more) leetcode problems (tree/binary, data structures). Coding and understanding top 150 leetcode problems from neetcode will be enough.
Viewing 1 - 10 interview questions