Google

Part 1: OA 2 questions: Data Structures and Algorithms (Do Blind 75 and Neetcode 150) All these will be together in the span of 2 days. Part 2 (if forward): Behavioral 3 Technical rounds (DSA and Googliness)

First, there is a phone screen – a mini technical interview. It's the same as the main round of technical interviews, but it's isolated. Then, there are three technical interviews and one Googleyness interview, which is sort of a leadership intervie

Knight's pad L-shaped movement: How many possibilities given n digits? Recursively: Firstly, 1, store the result. Then, 2, store. The new matrix gets the result from the sum of a line of the previous matrix. Iterator of Iterator IteratorIteratorT