Summer 2026 Google SWE Intern OA / Interviews: 42 Experiences (Part 1 :)

A practical roundup of 42 firsthand reports that produced 59 published Google SWE/SDE Intern practice problems for the Summer 2026 cycle.

Coverage: Software Engineering / Software Development Intern; bachelor's, master's, and PhD candidates; OA, live technical screens, virtual onsites, and selected team-matching context; reports from July 2025 through March 2026 across the United States, India, China, Europe, Israel, and Japan.

The short version

The most consistent signal is not one magic LeetCode list. It is a two-part test: solve a fresh algorithmic problem in a plain editor, then keep reasoning when the interviewer changes the rules.

1. Two 45-minute coding rounds were the most repeated live-loop shape. Several candidates described back-to-back or same-day technical interviews, usually in a shared document without a runnable IDE. A few reports used 50- or 60-minute rounds, and mixed feedback sometimes triggered an additional interview.
2. The question pool was genuinely broad. The 59 preserved tasks span arrays, strings, graphs, trees, dynamic programming, greedy methods, heaps, streaming state, matching, scheduling, and randomized sampling. Memorizing only one topic cluster would have left large gaps.
3. Clarification, testing, and follow-ups mattered as much as the first solution. Reports repeatedly mention defining the input, finding edge cases, dry-running code, explaining complexity, and improving a working approach. A correct brute-force start was useful, but it was rarely the end of the conversation.
4. Graphs appeared in many disguises. Candidates saw connected components, cycle detection, shortest paths, simultaneous-time propagation, bipartite matching, reachability, grid traversal, and DSU over letters. The surface stories changed; the underlying graph decisions did not.
5. Streaming and scheduling deserve more attention than a generic “Google tagged” list suggests. Top-k maintenance, timestamp lookup, FIFO matching, overlapping jobs, cyclic-day servers, meeting rooms, and first-unique events all appeared in this corpus.
6. PhD Intern still meant serious coding. Eleven PhD reports contributed 19 of the questions. Some candidates briefly discussed research, but their technical rounds still included DP, graphs, heaps, matching, streams, and interviewer-authored applied problems.
7. OA evidence varied by pipeline and location. Four independent OA reports preserved six runnable questions, but other candidates moved from recruiter contact directly to live interviews. Treat the OA as one possible entry path, not a universal fixed template.

A practical preparation formula: make BFS/DFS, hashing, heaps, binary search, interval sweeps, and one-dimensional DP automatic → practice turning a vague story into a precise contract → code in a blank document while narrating → always reserve time for examples, complexity, and one follow-up.

Online assessments (OA)

OA 01: Dynamic ternary updates plus parity-run subsequences

Report date: July 5, 2025 · Role: SWE Intern 2026 · Stage: OA

1. Minimum Swaps to Sort a Ternary Array After Updates: after each point update to an array containing only 1, 2, and 3, return the minimum arbitrary swaps needed to sort it.
2. Count Valid Parity-Run Subsequences: count non-empty subsequences that never contain three selected even values in a row and never contain three selected odd values in a row.

This report preserved both task contracts. The first rewards maintaining mismatch counts; the second is a compact state-DP problem.

OA 02: Sixty minutes, combinatorics and DP

Report date: July 6, 2025 · Role: Software Engineer Internship 2026 · Location: Gandhinagar

The candidate reported two DSA questions in a 60-minute assessment. The complete one, Count Permutations Without Three Same-Parity Values, asks for the number of permutations with no run of three even values and no run of three odd values.

The source called one problem medium-hard combinatorics and the other hard DP, but only the parity-permutation contract was complete enough to publish.

OA 03: K-th largest state and exact-K bit flips

Report date: July 22, 2025 · Role: Summer Intern 2026 · Location: India

1. Power Update After K-th Largest Insertion: insert a value, find the current k-th largest value, and update a running number by modular exponentiation.
2. Minimum Operations to Flip Exactly K Bits: flip exactly k distinct bits per operation and minimize the operations needed to reach all ones.

The wording says “elements,” not “a length-k subarray,” so the published practice version keeps the arbitrary-position interpretation. That distinction changes the algorithm completely.

OA 04: Three medium-hard questions in Tokyo

Report date: March 25, 2026 · Role: Software Engineer Internship · Location: Tokyo

The candidate reported three online-test questions: two graph problems and one dynamic-programming problem. The exact preserved task was Trapping Rain Water; the other two topics were too broad to reconstruct without inventing their contracts.

38 detailed live-interview timelines, loops, and screens

The four OA reports above count as experiences 01–04. The live-interview accounts begin here and continue across Parts 2 and 3. Practice links now sit beside the report that produced them; reconstructed versions are labeled where they appear.

05: Vertical-order traversal after a coding test

Report date: July 17, 2025 · Role: Software Engineer Intern · Result: No offer

The candidate described a coding test followed by DSA interviews. The first preserved live question was Binary Tree Vertical Order Traversal. The report did not settle every same-position ordering rule, so the practice version uses an explicit breadth-first convention.

06: Equal-offset index pairs

Report date: July 20, 2025 · Role: Software Engineer Intern · Location: Bengaluru

The exact relation in Count Index Pairs With Equal Offset was arr[i] - arr[j] = i - j. Rewriting it as arr[i] - i = arr[j] - j turns a quadratic pair search into frequency counting. This was a good example of Google hiding a hash-map invariant inside an algebraic condition.

07: A one-hour three-way bitwise partition

Report date: July 27, 2025 · Role: Software Engineer Intern · Result: No offer

The candidate reported one DSA problem intended for roughly an hour: Maximize XOR-AND-XOR Over a Three-Way Partition. Every value goes into one of three possibly empty subsequences, and the score is XOR(A) + AND(B) + XOR(C). The empty-subsequence rules were explicitly stated, making this one of the most complete hard prompts in the set.

08: DSU over the alphabet

Report date: July 30, 2025 · Role: SWE Intern · Location: India · Result: Accepted

In Count Player Teams by Shared Letters, players were connected when their names shared a letter, and the task was to count the resulting teams. The candidate recorded the intended compression: union the 26 lowercase letters rather than constructing every pairwise player edge.

09: Minimum CPUs with a priority queue

Report date: August 1, 2025 · Role: Software Engineer Intern · Location: Hyderabad · Result: Offer

The process included an OA and two technical interviews over five days. The live task, Minimum CPUs for Fixed-Duration Jobs, supplied job start times and one shared duration, then asked for the minimum CPU count. The candidate's public explanation used a min-heap and tracked its maximum size.

10: Two back-to-back rounds, starting with 2D DP

Interview date: September 26, 2025 · Role: SDE Intern · Level: Bachelor's

The candidate had two 45-minute rounds with a 30-minute break. Round one was described as a two-dimensional DP adaptation of Merge Stones. The second problem was not preserved well enough to name, and the author felt the overall difficulty was higher than expected.

11: Parallel courses, then one editable value

Report date: October 8, 2025 · Role: SDE Intern · Level: Master's

Two 45-minute rounds came with a 15-minute break and no warm-up questions. The first task was later corrected to Parallel Courses III. The second became Longest Nondecreasing Subarray After One Modification: find the longest contiguous nondecreasing run when one number may be changed.

12: A known problem under interview pressure

Report date: October 16, 2025 · Role: Intern · Stage: Live technical interview

The candidate recognized Minimize the Maximum Pages Allocation, explained brute force and the binary-search solution, then made a wrong-variable mistake during the dry run before correcting it. The account is useful because the problem identity was not the real failure mode; execution, explanation, and recovery were.

Part 2 continues with experiences 13–28, including currency conversion, two PhD-heavy clusters, U.S. offer paths, and the Shanghai rounds.