Interview 1: simple algorithms on tree Interview 2: simple application of heap Interview 3: splitting a rectangle into squares Interview 4: variants of finding shortest path between grid cells, extension for multithreading Interview 5: segment tree In general, not very difficult or surprising for me. Preparation is definitely required. It might not be too hard for me because I have long time interest in coding algorithms for fun, and to serve my Phd research.
NDA so can’t share. But not on leetcode or Glassdoor
What's the biggest challenge you've met in your recent project?
What happened when you enter an URL in the browser
good card shuffling algorithm
For me the hardest part was to get over the Google Doc format (no syntax highlighting or code completion) and starting the code from scratch, which is not generally what I do on my day to day basis.
Code the algorithm of K-means clustring from scratch
Describe one of your research work you believe is important.
Q: Please introduce yourself to us.
Prefix Sum, BFS/DFS, System design of a social network
Viewing 1361 - 1370 interview questions