If you solve easy/medium level leetcode problems should be fairly ok to get through as an undergraduate. HR and Engineer interviews also went well - they were kind and willing to listen.
Interview questions [1]
Question 1
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
As expected from a Google interview, it consists of a phone interview and a technical interview. In my opinion, with the skill level Google is looking for, the interview is fair and accurately tests the ability of a candidate. I imagine the interview for full-time positions is harder, but as an intern, I felt that it was the right amount of difficulty and complexity.
there is no online assessment, very simple phone call, then two technicals. technicals are not difficult by any means. then you get put into team matching, after a couple months
I applied online. I interviewed at Google (Sydney) in Jun 2026
Interview
Resume screening and then two 2 rounds of technical interviews, on an elimination basis. Interview done on google docs with no IDE, dsa leetcode style question. May be asked follow up questions on how to optimise your solution or on how you would code up a solution to a similar problem.
Interview questions [1]
Question 1
DSA tree question, medium-hard leetcode difficulty.