The recruitment process for this position proved to be excessively lengthy and cumbersome, involving numerous stages that felt repetitive. Additionally, maintaining consistent communication with the recruiter was quite challenging, as responses were often delayed, making it difficult to stay informed about my candidacy status throughout the journey.
Interview questions [1]
Question 1
Given N numbers: a[0], a[1], ..., a[N-1]
find i <= j such that:
a[i] = a[j]
and
sum a[i] + a[i+1] + ... + a[j-1] + a[j] is maximized.
1. Recruiter screen (20 minutes, video call): Confirmed eligibility, location preference, internship dates, and asked basic questions about my background.
2. Online coding assessment (90 minutes): 2 coding questions focused on data structures/algorithms.
3. Technical interviews (2 rounds, 45 minutes each, video): Live coding + problem-solving and explaining my approach.
Interview questions [1]
Question 1
• “Given an array of integers, return the length of the longest subarray that satisfies [a condition]. Explain your time complexity.”
• “Design an algorithm to detect if two strings are one edit away. Walk through edge cases.”
• “Tell me about a project you built and what you would improve if you had more time.”
I applied through college or university. I interviewed at Google (Noida) in Aug 2025
Interview
It was an on campus drive where I had an OA after which there were 2 technical interviews focusing solely on DSA . The questions were leetcode medium -hard with multiple follow-ups for different cases
Interview questions [1]
Question 1
It was a graph question similar to flood filling but we also had to greedily place ships in the water