Google SWE4 Technical Screening and Behavioral Interview Experience
Question Details
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]| <= dif
Full Details
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.
About This Question
This is a reported interview question from a google interview for a swe role during the behavioral round reported in 2026.
It covers the following topics: Arrays, Graph, Sorting, Behavioral .