Google · Phone screen → Onsite
In processGoogle SWE Intern OA and Interviews: 42 Experiences (Part 1 of 3)
Google Summer 2026 SWE intern reports, Jul 2025–Mar 2026: a 60-minute OA with two or three DSA tasks, then two 45-minute rounds on graphs, DP and heaps.
At a glance
- Process: an OA in some pipelines (60 minutes, two DSA tasks in OA 02; three tasks in OA 04), then two 45-minute live coding rounds with a 15- or 30-minute break, in a shared doc (09, 10, 11). Some went from recruiter to live rounds with no OA.
- Asked recently: across these 12 reports, DP or combinatorics in 4, graphs or union-find in 3, heaps and scheduling in 2, and binary search, hashing and bit manipulation once or twice each.
- Difficulty: OA tasks were called medium-hard to hard (02, 04); one live round had a single hour-long hard problem (07). A known problem still went wrong under pressure for 12.
- Practise first: Merge Stones, Parallel Courses III, Minimum CPUs for Fixed-Duration Jobs and Count Index Pairs With Equal Offset.
Coverage: Google SWE / SDE Intern, Summer 2026, bachelor's and master's where stated. Twelve reports in this part: four OAs (Jul 2025 – Mar 2026, India and Tokyo) and eight live interviews (Jul – Oct 2025). The series has 42 reports.
In this series
- Part 1 (current): OA reports and the first live-interview timelines, entries 01–12.
- Part 2: entries 13–28, including currency conversion, PhD loops, U.S. offers and Shanghai rounds.
- Part 3: the remaining live-interview timelines.
What came up
The OA leaned on counting and DP; the live rounds on graphs, heaps and one solid trick per problem, such as turning a pair condition into a frequency count.
| Topic | Reports | Last seen |
|---|---|---|
| DP or combinatorics | 4 of 12 | Mar 2026 (report date) |
| Graphs, union-find or topological order | 3 of 12 | Mar 2026 (report date) |
| Heaps and scheduling | 2 of 12 | Aug 2025 (report date) |
| Arrays and hashing | 2 of 12 | Oct 2025 (report date) |
| Binary search on the answer | 1 of 12 | Oct 2025 (report date) |
| Bit manipulation | 2 of 12 | Jul 2025 (report date) |
| Trees | 1 of 12 | Jul 2025 (report date) |
A candidate can appear in more than one row.
Questions we found
Online assessment
| Question | Reports | Last seen |
|---|---|---|
| Trapping Rain Water | 1 | Mar 2026 (report date) |
| Power Update After K-th Largest Insertion | 1 | Jul 2025 (report date) |
| Minimum Operations to Flip Exactly K Bits | 1 | Jul 2025 (report date) |
| Count Permutations Without Three Same-Parity Values | 1 | Jul 2025 (report date) |
| Minimum Swaps to Sort a Ternary Array After Updates | 1 | Jul 2025 (report date) |
| Count Valid Parity-Run Subsequences | 1 | Jul 2025 (report date) |
Live coding rounds
| Question | Reports | Last seen |
|---|---|---|
| Minimize the Maximum Pages Allocation | 1 | Oct 2025 (report date) |
| Parallel Courses III | 1 | Oct 2025 (report date) |
| Longest Nondecreasing Subarray After One Modification | 1 | Oct 2025 (report date) |
| Merge Stones (2D DP adaptation) | 1 | Sep 2025 |
| Minimum CPUs for Fixed-Duration Jobs | 1 | Aug 2025 (report date) |
| Count Player Teams by Shared Letters | 1 | Jul 2025 (report date) |
| Maximize XOR-AND-XOR Over a Three-Way Partition | 1 | Jul 2025 (report date) |
| Count Index Pairs With Equal Offset | 1 | Jul 2025 (report date) |
| Binary Tree Vertical Order Traversal | 1 | Jul 2025 (report date) |
Online assessments (OA)
OA 04: Three medium-hard questions in Tokyo
Report date: Mar 25, 2026 · Role: Software Engineer Internship · Location: Tokyo
- Three online-test questions: two graph problems and one DP problem. The one named exactly was Trapping Rain Water; the other two were described only by topic.
OA 03: K-th largest state and exact-K bit flips
Report date: Jul 22, 2025 · Role: Summer Intern 2026 · Location: India
- Power Update After K-th Largest Insertion: insert a value, find the current k-th largest, and update a running number by modular exponentiation.
- Minimum Operations to Flip Exactly K Bits: each operation flips exactly k distinct bits; reach all ones in as few as possible. The wording said "elements", not a length-k subarray, which changes the algorithm.
OA 02: Sixty minutes of combinatorics and DP
Report date: Jul 6, 2025 · Role: Software Engineer Internship 2026 · Location: Gandhinagar
- Two DSA questions in 60 minutes: one medium-hard combinatorics, one hard DP.
- The fully described one: Count Permutations Without Three Same-Parity Values, the number of permutations with no three evens or three odds in a row.
OA 01: Ternary updates and parity-run subsequences
Report date: Jul 5, 2025 · Role: SWE Intern 2026 · Stage: OA
- Minimum Swaps to Sort a Ternary Array After Updates: after each point update to an array of 1s, 2s and 3s, return the minimum swaps to sort it (track mismatch counts).
- Count Valid Parity-Run Subsequences: count non-empty subsequences with no three chosen evens or three chosen odds in a row (a small state DP).
8 detailed live-interview timelines
12: A known problem under pressure
Report date: Oct 16, 2025 · Role: Intern · Stage: Live technical interview
- They recognized Minimize the Maximum Pages Allocation and explained brute force and binary search on the answer.
- A wrong-variable mistake surfaced in the dry run; they corrected it. Knowing the problem was not the hard part; executing and explaining it was.
11: Parallel courses, then one editable value
Report date: Oct 8, 2025 · Role: SDE Intern (master's)
- Two 45-minute rounds, a 15-minute break, no warm-up.
- Round 1: later identified as Parallel Courses III.
- Round 2: Longest Nondecreasing Subarray After One Modification: the longest contiguous non-decreasing run if you may change one number.
10: Back-to-back rounds, starting with 2D DP
Interview date: Sep 26, 2025 · Role: SDE Intern (bachelor's)
- Two 45-minute rounds with a 30-minute break.
- Round 1: a 2D DP adaptation of Merge Stones. The second problem was not recorded well enough to name. Overall harder than they expected.
09: Minimum CPUs with a priority queue
Report date: Aug 1, 2025 · Role: Software Engineer Intern · Location: Hyderabad · Result: Offer
- An OA and two technical interviews within five days.
- Minimum CPUs for Fixed-Duration Jobs: job start times and one shared duration; find the fewest CPUs. They used a min-heap and tracked its largest size.
08: Union-find over the alphabet
Report date: Jul 30, 2025 · Role: SWE Intern · Location: India · Result: Accepted
- Count Player Teams by Shared Letters: players connect when their names share a letter; count the teams.
- The key step: union the 26 lowercase letters instead of building every player-to-player edge.
07: A one-hour three-way bitwise partition
Report date: Jul 27, 2025 · Role: Software Engineer Intern · Result: No offer
- One DSA problem for about an hour: Maximize XOR-AND-XOR Over a Three-Way Partition. Each value goes into one of three possibly empty groups, scoring
XOR(A) + AND(B) + XOR(C), with the empty-group rules stated.
06: Equal-offset index pairs
Report date: Jul 20, 2025 · Role: Software Engineer Intern · Location: Bengaluru
- Count Index Pairs With Equal Offset: count pairs with
arr[i] - arr[j] = i - j. - Rewriting it as
arr[i] - i = arr[j] - jturns a quadratic search into frequency counting.
05: Vertical-order traversal after a coding test
Report date: Jul 17, 2025 · Role: Software Engineer Intern · Result: No offer
- A coding test, then DSA interviews. The first live question was Binary Tree Vertical Order Traversal; the practice version fixes a breadth-first order for ties, which the report left open.
Patterns across the reports
- Two 45-minute rounds with a break. 10 and 11 both described this, with breaks of 30 and 15 minutes; 09 had two interviews after the OA.
- One algebra or modeling step unlocks the problem. Rewriting the pair condition (06), union-find over letters (08) and binary search on the answer (12).
- Parity-run counting in the OA. Two India OAs in July 2025 asked about runs of three same-parity values (01, 02).
Common questions
How long is the Google intern OA?
60 minutes for two DSA questions in one report (OA 02); a Tokyo OA had three questions (OA 04).
How many live rounds does Google give interns?
Two 45-minute coding rounds with a 15- or 30-minute break (10, 11).
Is the Google intern OA hard?
Candidates called the questions medium-hard to hard (OA 02, OA 04).
Keep practicing
- Merge Stones (10), Parallel Courses III (11) and Minimum CPUs for Fixed-Duration Jobs (09): the live tasks with the clearest prompts.
- Google problem bank: every Google coding question on FastPrep (sign-in needed).
- Google 2027 intern tracker: the next cycle's reports.
- Google interview page and Google hiring insights.
- Experience feed: the latest interview write-ups.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.