LeetCode Experience · Jan 2019 · Paris

Google New Grad Onsite

SWE Onsite New Grad Easy
17 upvotes 5,020 views 2 replies

Interview Experience

5 Rounds of Interview. 1. Simple question involving pushing and popping elements off a queue. 2. Given array, check if there\'s an arithmetic sequence of length 3. Follow up: given an...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Binary Tree Dynamic Programming Graph Matrix Queue Sorting Stack