Google Screening Rounds SWE4

google logo
google
· SWE4
March 19, 2026 · 1 reads

Summary

I underwent two screening rounds for a SWE4 position at Google. The first round focused on a graph problem with follow-ups, while the second round was a comprehensive behavioral and leadership assessment.

Full Experience

ScreeningRound1: Coding

Given a sorted array arr of size N, and an integer diff, construct an undirected graph where each node represents an index. Connect nodes i and j if |arr[i] - arr[j]| <= diff. You are given a list of queries [u, v]. Return a list of booleans indicating whether there is a path between u and v.

Example: arr = [1, 2, 3, 6]; diff = 2; queries = [[0, 2], [1, 3]] Output: [True, False]

Followups:

  1. what if array is sorted in desc order.
  2. what is input array is not sorted.
  3. which sorting algorithm will you use.

Interviewer was very chatty, asked me to hurry while coding, wanted me to discuss the coding approach with time and space complexity for bruteforce/sub-optimal solution and then wanted me to move to optimisation. Completed exactly in 45 mins. Also this was a repeat question asked in prev interviews.

ScreeningRound2: Behavioural and Leadership

  1. Went on for 40 mins.
  2. Started with how my work day looks like.
  3. Then jumped to how do I prioritse work items.
  4. How do I resolve technical conflict between two junior devs.
  5. How will I evaluate technical docs.
  6. Mentoring juinors.
  7. How will I contribute and scale innovations.
  8. What do I do in my team to transfer information and knowledge
  9. Alot of questions about culture, what would I do to improve culture in the team, in my org and etc.
  10. what is one non negotiable culture for me in a team and how will I work on improving it.

Interview Questions (10)

1.

Graph Connectivity in Sorted Array with Difference Constraint

Data Structures & Algorithms·Medium

Given a sorted array arr of size N, and an integer diff, construct an undirected graph where each node represents an index. Connect nodes i and j if |arr[i] - arr[j]| <= diff. You are given a list of queries [u, v]. Return a list of booleans indicating whether there is a path between u and v. Example: arr = [1, 2, 3, 6]; diff = 2; queries = [[0, 2], [1, 3]] Output: [True, False] Followups: #1 what if array is sorted in desc order. #2 what is input array is not sorted. #3 which sorting algorithm will you use.

2.

Describe a Typical Work Day

Behavioral

How my work day looks like.

3.

Prioritizing Work Items

Behavioral

How do I prioritse work items.

4.

Resolving Technical Conflicts

Behavioral

How do I resolve technical conflict between two junior devs.

5.

Evaluating Technical Documents

Behavioral

How will I evaluate technical docs.

6.

Mentoring Juniors

Behavioral

Mentoring juinors.

7.

Contributing and Scaling Innovations

Behavioral

How will I contribute and scale innovations.

8.

Knowledge Transfer in Team

Behavioral

What do I do in my team to transfer information and knowledge.

9.

Improving Team Culture

Behavioral

Alot of questions about culture, what would I do to improve culture in the team, in my org and etc.

10.

Non-Negotiable Team Culture

Behavioral

what is one non negotiable culture for me in a team and how will I work on improving it.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!