Google swe sre Dublin phone screen
- Result
- Ongoing
- Location
- dublin
- Posted
- 13 Nov 2025
Summary
I had a phone screen for a SWE SRE role at Google in Dublin, which involved solving several prime number-related algorithmic problems, including designing an algorithm for 'supercut' prime numbers and implementing an optimized Sieve of Eratosthenes.
How it went
I recently had a phone screen for a SWE SRE position at Google in Dublin. The interview lasted about 1 hour and 5 minutes and involved a series of algorithmic challenges. I started with a simple prime number problem, which then evolved into designing an algorithm for what they called 'supercut' prime numbers. I was asked to optimize my solution further. Following this, I was tasked with implementing the Sieve of Eratosthenes algorithm and then optimizing that solution as well. There were more than 5 follow-up questions throughout the discussion.
Questions asked (3)
- 01
Simple Prime Number Problem
Data Structures & Algorithms
I was asked to solve a simple problem related to prime numbers. This likely involved checking if a given number is prime or finding primes within a basic range.
- 02
Design Algorithm for Supercut Prime Numbers
Data Structures & Algorithms
After the initial prime number problem, I was challenged to design an algorithm for 'supercut' prime numbers. The task also involved optimizing the developed code.
- 03
Implement and Optimize Sieve of Eratosthenes
Data Structures & Algorithms
I was asked to implement the Sieve of Eratosthenes algorithm. Following the implementation, I had to further optimize the algorithm, likely focusing on time or space complexity.