1p3a_oj
Question
Maximum Sum Subarray with Equal Endpoints
Question Details
Problem: Maximum Subarray Sum with Equal Endpoints Given an integer array a, find a pair of indices (i, j) such that: 0 <= i <= j < n a[i] == a[j] Among all such pairs, maximize the s
Full Details
🔒
Unlock all Google questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a google interview for a swe role during the coding round.
It covers the following topics: Arrays .
Topics
More Google Interview Questions
Reddit
7 months in Google Team Matching
Reddit
Google L4 SWE prep
Reddit
Google team matching new grad 2026 - US
Reddit
I got offers from Google, Meta, Amazon (SWE intern) by GRINDING for exactly ONE year which made technical interviews for big tech TRIVIAL (rant)
Reddit
Google L4 India - Accepted | Compensation and Preparation