1. SD: When designing a goole doc app, given a load balancer randomHash(n)/100, discuss its performace when the system scales. 2. SD: Given 3 app ideas, discuss whether strong consistency or eventual consistency is better. 3. Coding: Given a list of intervals of busy times of n people, return a list of intervals when these n people are available for a meeting. Time is represented by 24-hr format(12:00 -> 1200, 0:00 -> 0000)
find the largest square in a matrix which the sum of numbers in the square less or equal to K
Got the assessment questions. There are two questions related to basic concepts learned in school
Algorithm question, using hash map, priority queue to solve
I was asked about my projects and stuff on resume. Algorithms, data structures.
Turn a n-ary tree into a binary tree.
hard level coding question of strings
find nearest possible time using digits of current time in a 24 hour clock
1) Possible ways to get from top left of mxn matrix to the top right 2) Make a code editor refractor (string replacement) 3) Find the longest path in a DAG 4) Card class and functions
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.
Viewing 291 - 300 interview questions