Google E4 Telephonic Round
- Posted
- 3 Jun 2025
Summary
I had a telephonic interview for a Google E4 role where I was asked to solve a problem involving finding the maximum sum of a contiguous subarray with equal start and end elements.
How it went
I had a telephonic round for a Google E4 role. The main problem presented was to find i and j such that the sum of a contiguous array from a[i] to a[j] is maximized, with the condition that a[i] must be equal to a[j] and j > i.
Questions asked (1)
- 01
Maximum Contiguous Subarray Sum with Equal Endpoints
Data Structures & Algorithms
Find i and j such that sum of Contiguous array is maximised.
a[i] = a[j] where j > i Maximise (a[i] + a[i+1] + . . . . + a[j])