1p3a Experience · May 2026

google l4 fulltime software engineer onsite interview experience

SWE Onsite newgrad
6 upvotes 28 replies

Interview Experience

本帖最后由 匿名 于 2026-5-20 17:45 编辑 新鲜两轮 on-site 面经 以下内容需要积分高于 200 您已经可以浏览 Round 1: Given a 2D array with size of N x N, 'H' denotes house, '0' denotes empty space H 0 0 0 H 0 0 0 0 0 0 H 0 0 0 0 要求 1. 每行和每列都需要 one and only one 花 'F' 每个'H' 四周 都只能有且仅有一朵花 'F' 返回任意的方案 经典 N-queens 八皇后问题变种, dfs + backtrack 可解 Round 2: 有点像力扣 幺儿伞伞 Given getChildrenPaths(String path) 这两个api...

Full Details

🔒

Unlock all Google questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — from $50/mo

About This Question

This is a candidate experience report from a google interview for a swe role (newgrad level) during the onsite round reported in 2026.

It covers the following topics: Strings, Arrays, Graph, Backtracking, Matrix .

About Google Interview Reports

This question was reported by a candidate who interviewed at Google. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.

Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Google are the higher-signal extractions to take from this report.

For broader preparation context, the Google interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.

How To Practice This Type of Question

Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.

Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Google reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Google Round

Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.

The single most predictive failure mode in Google reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.