RepostedGoogle logo

Google · Onsite

In process

Google SWE Intern Extra Interview Round: 2 Experiences

Software engineer · InternshipOct 2026
Shared byjanebeingjane

Two Google SWE intern candidates in October 2026 were asked for a third technical round after two coding interviews; one then waited until mid-November.

At a glance

  • Process: two technical interviews, then a request for an extra technical round about five days later (01, 02). Report 02's two rounds were 45 minutes each on the same day.
  • Asked recently: two prefix-sum array problems in report 02: a maximum-sum subarray with equal endpoints, and a score of two endpoints minus everything between them. Report 01 did not share its questions.
  • Difficulty: candidate 02 needed hints on boundary cases and did not finish a follow-up; candidate 01 felt the extra round went smoothly.
  • Practise first: Maximum Subarray Sum With Equal Endpoints and Maximum Subarray Endpoint Score.

Coverage: two Google SWE summer-intern candidates with interviews in October 2026. Report 02 names the U.S. Summer 2027 cohort; report 01 does not state its year. Neither report gives a final result.

Related: this post is a companion to the Google 2027 intern tracker: Part 1 (graphs and OOD), Part 2 (paths, grids, trees), Part 3 (prefix sums and heaps), Part 4 (loops and team matching), Part 5 (grids, DP, OOP and AI), Part 6 (trees and knapsack), Part 7 (PhD and return offers) and Part 8 (updates and host calls).

What came up

Both candidates were asked for a third technical interview. Only one shared the coding questions.

Topic Reports Last seen
Extra technical round after two interviews 2 of 2 Oct 2026
Prefix sums and maximum-subarray variants 1 of 2 Oct 2026
Debugging and boundary cases 1 of 2 Oct 2026
Competing-offer deadline raised with the recruiter 1 of 2 Oct 2026

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Maximum Subarray Sum With Equal Endpoints 1 Oct 2026
Maximum Subarray Endpoint Score 1 Oct 2026

Both came from report 02. The problem pages hold the full sighting history from other Google reports.

2 detailed candidate timelines

02: Two prefix-sum rounds, then an extra-round request

Interview date: October 12, 2026 (an earlier post by the same candidate labels it October 13) · Role: U.S. Summer 2027 SWE Intern · Status: third technical round requested

Round 1: equal endpoints, largest sum (45 minutes)

  1. The interviewer pasted the question into a shared document with little introduction. The candidate read it, restated it in English and checked their understanding.
  2. The task: return the endpoints of the largest-sum subarray whose first and last values are equal. Values can be negative. The candidate asked about all-distinct inputs and whether one element counts; the interviewer confirmed i == j is allowed, so a lone 100 can beat a longer range.
  3. Approach: an O(n³) brute force first, then prefix sums plus a hash map that keeps, for each value, the smallest prefix sum before a matching start. O(n) time and O(n) space.
  4. Coding ran from about minute 10 to minute 20 while the interviewer watched quietly. The candidate traced [1,2,3,2,5]: the best range is [1,3] with sum 7. That and the complexity talk took them to about minute 30.
  5. Follow-up: drop the equal-endpoint rule. The candidate explained that one global minimum prefix sum replaces the map. The interviewer wanted a separate function under the original; the candidate misunderstood, started editing the original, and had to undo it. Time ran short, so the new logic was explained but not finished.
  6. Asked about space, they first said O(n); after a prompt toward O(1), they saw that a few running values were enough, which also works for streaming input.
  7. Afterwards they worried the first version had missed the single-element case but could not recall the code well enough to be sure. In the closing questions the interviewer talked about mentors, teamwork, finishing projects and possible AI-agent work for a team.

Round 2: endpoints minus the middle (45 minutes)

  1. This interviewer introduced the round and offered to explain the prompt; the candidate read it first, restated it and asked questions.
  2. The task: maximize the sum of a subarray's two endpoints minus the values between them. At least two elements; values can be negative; return the best score.
  3. After brute force, the candidate split the score algebraically into a start part and an end part, so a running best start contribution avoids checking every pair. The interviewer asked how to choose that start in one pass; after a misunderstanding, the candidate explained the running maximum and coded it.
  4. Two bugs needed hints. Starting the answer at 2 * nums[0] allowed a one-element range, against the two-element minimum. The prefix sum was set in the wrong order; asked what one line actually assigned, the candidate spotted the mismatch, reordered it and removed an extra assignment.
  5. They traced each step (current score, best score, prefix sum, best earlier contribution), fixing a few arithmetic slips, and reached 9 for the given example (the input was not shared). O(n) time and O(1) space were accepted.
  6. Around minute 40 the interviewer asked whether the code could be cleaner, for example without an extra prefix-sum variable. With little time left, the candidate explained the cleanup aloud. Feedback, the interviewer said, would come through the recruiter.

After the rounds

  1. The candidate was unsure whether the hints, the unfinished follow-up and slow debugging meant a rejection or another round.
  2. Later in October, HR asked for a third technical interview to "collect more data points". No date, questions or result from that round were reported, and no offer or team match was mentioned.

The first account of these two rounds also appears in Part 5 of the Google 2027 tracker.


01: A third round, then a wait until mid-November

Interview dates: October 7 and 21, 2026 · Role: Summer SWE Intern · Status: waiting for feedback after the extra round

  1. October 7: finished the first two technical interviews.
  2. October 12: got a request for one more technical interview.
  3. October 21: finished the third interview. The candidate felt it went smoothly and said the interviewer's feedback seemed positive.
  4. October 26: wrote to the recruiter because another offer's deadline was close. The recruiter said feedback would not come before mid-November at the earliest; no decision date was promised.
  5. The candidate wondered whether the wait came from committee review, internal processing or comparison with other candidates; the post does not say which. No questions from any round were shared, and no decision or team match had been reported at the last update.

Patterns across the reports

  1. An extra round after two interviews. Both candidates were asked for a third technical interview after their first two (01, 02), about five days later in report 01.

Common questions

Why does Google ask for an extra intern interview?

In report 02, HR said it wanted more data points. Report 01 was not given a reason.

How long does Google take to give feedback after an extra intern interview?

Report 01's recruiter said not before mid-November, about three to four weeks after the October 21 round.

What coding questions came up in the Google intern rounds before the extra interview?

Report 02 got two prefix-sum array problems, each with a follow-up on cutting space to O(1) or changing a rule; report 01 did not share questions.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.