Online Test: same as everyone posted. Array jump problem, dice problem, Six degree problem, Why liveRamp.
1-st Round Phone Interview: explain how to solve six degree problem (BFS), explain the runing time using branching factor(some notation specified by the interview). Why not use Dijkstra's algorithms. key point: use hash table to track visited nodes. How to recover the path: use an array to record the parent that leading to the traversal to the current node. How to improve the run time: I said to start from two nodes and let them waking towards each other.
Interview questions [1]
Question 1
how to improve the run time of bfs solution to 6 degree problem
"The interview process starts with a hiring manager call, followed by the first technical interview, then a second technical interview, and concludes with a final hiring manager discussion covering various topics."
Interview questions [1]
Question 1
Average Leetcode Question and its expansion on top of that
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions.
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions.
Interview questions [1]
Question 1
leetcode questions. you will be good if you spend time on solving coding problems. self intro and follow up questions
straightforward when i was there. phone screen and an onsite. the on site is whiteboarding algorithms. there is also system design and behavioral sessions. they respond quickly afterward. great team.
