google logo
Google· E4

Google E4 Telephonic Round

Posted
3 Jun 2025
360 reads

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)

  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])

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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