I applied for a Google SWE position and went through a recruiter call first. The recruiter was very friendly and clear about the process. My phone screen had two coding questions:

• One on arrays (two sum variant)
• Another on dynamic programming (unique paths)

I solved the first one quickly but needed hints on the DP problem.

Coding: Given a list of integers, find the length of the longest consecutive sequence.

Coding: Implement a function to check if a string is a palindrome using recursion.

System Design: Design a URL shortening service like bit.ly.

Coding / Algorithm: Find the minimum number of coins needed to make a given amount (coin change problem).

Behavioral: Tell me about a time you disagreed with a teammate and how you resolved it.