Interview 2: Like the first interview this one started with basic cv questions and a simple coding question. Then moved onto a longer question that was basically weighted graph search but the edge weights were dynamic. Harder than the first interview but still not too difficult compared to other companies. I'd say about similar in difficulty to google but easier than palantir.
Interview 1: Started with basic cv chit-chat and discussing projects. Was asked general information (complexity and high level implementation) about data structures you'd expect to find in standard libraries. Continued on to a super simple coding question that was something like reversing a string in place. Then had a longer coding question that was a variant on the subtree sum problem and could be made to run in O(n) time with some preprocessing. Overall not particularly difficult.
Classic interview question about matrixes sorted row and column wise.
Asked two questions 1. sort using sliding window 2. binary search functional program
Signed NDA
I would like to respect the NDA
I'm still waiting feedback.
Given nxn grid with some squares that are impassable discuss an algorithm to find a path from start to goal.
How to validate binary search tree?
Write a recursive in order search of a BST
Viewing 1811 - 1820 interview questions