Round 1
Questions: Given an array, write an algorithm to find the maximum sum of subarray i to j such that i <= j and a[i] == a[j] in C++. The elements in the array can be negative as well. Asked by Google in the last Technical Round for L4.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.