Software Engineer · Phone Screen · Coding

[ OK ] 2eb0516f-aaed-41b7-981f-ccea5bf44a9e — full writeup

[ INFO ] category: Behavioral · Coding difficulty: 3 freq: first seen: 2026-03-15

[3][CODING]Algorithms

$ cat problem.md

Google — Software Engineer

Level: Junior-Level

Round: Phone Screen · Type: Coding · Difficulty: 3/10 · Duration: 60 min · Interviewer: Friendly

Topics: Algorithms

Location: San Francisco Bay Area

Interview date: 2025-11-15

Summary

I received an online assessment after applying for the SWE Early Career position.

Question 1: A one-dimensional board game with tokens and coins. Each token can only move right three steps at a time. How can you maximize the number of coins collected?

Question 2: Given a set of two-digit numbers (10-99), if two numbers share at least one digit, they are in the same group. Find the largest group within the set.

Details

I completed the online assessment as practice.

Question 1: The problem involves maximizing coin collection in a one-dimensional board game, where tokens can only move three steps to the right.

Question 2: The second question is grouping two-digit numbers based on shared digits and finding the largest group.

user@intervues:~/experiences/google$