I agreed not to disclose the specific questions I was asked, but they covered core data structure and algorithms and were moderately difficult. Each question allowed the interviewers to expand the problem if the initial task had been completed (i.e. how would you run this algorithm utilizing multiple threads / machines). My problems covered string parsing, online algorithms, bfs/dfs and memoized search
Assign values from a set to indices in a matrix such that a value isn't repeated 3 times in a row/column.
Validation Problems
NDA but it doesn't matter because it varies.
1st round: googlyness (behavioral). One question I remember 2nd round: recursion + dynamic programming question with strings 3rd round: ambiguous question to design a function that calculates the toll costs for cars/license plates on a highway. 4th round: linked list question
Question on linked lists, to add a node etc
Due to NDA, I cannot mention it, however, Leetcode helps.
atoi (phone interview)
Similar to LC problems, related to graph, greedy and recursive
They asked a lot about my projects on my resume. From the user base of each project to the reasonings behind the tech stacks I decided to use.
Viewing 761 - 770 interview questions