Google

I had an intern interview at Google where I was asked to determine if a given parent array forms a valid tree structure.

I had a phone screening interview with Google for an L4 role, which involved a coding problem about finding free days among a list of blockers with a follow-up about k-availability.

I recently appeared for a Google interview where I was asked two specific questions: finding the top K most sold products from CSV data and designing Snapchat. I partially solved the first question but made a critical error in my approach, and I struggled with the system design problem.

I shared my interview experience for the Google Summer Internship role. The process involved a phone screen focusing on projects and background, two technical rounds with specific coding problems, and a Googliness round covering behavioral aspects. I found the overall experience intense but fair, with supportive interviewers who valued my approach and reasoning.

I successfully completed a 60-minute phone interview for a Google L4 role, where I solved a multi-part coding question related to fraud detection, and subsequently advanced to virtual onsite rounds with Stripe.

I had a phone screen interview with Google for an L3 position in London. I was asked a problem about tracking people's presence in intervals based on entry/exit logs, and I'm currently waiting for feedback.

I applied for the Google STEP Internship (later Associate Software Developer) in India for 2024 through an alumni referral. My interview process involved an HR screening and two technical rounds focusing on data structures, algorithms, recursion, and design, but unfortunately, the final outcome was not in my favor.

I recently went through a Google system design interview where I was asked to design an end-to-end system for Google’s employee cab transportation service.

I interviewed at Google for an L4 position, completing multiple coding rounds and a behavioral/project discussion, and I am currently in the team match stage with positive feedback.

I recently completed my Online Assessment and Phonescreen for a Software Engineer L4 role at Google, facing three distinct algorithmic challenges.

Had a Google interview experience at the L4 level, with 2 technical rounds and 1 Googliness round. Despite a strong performance in the first technical round, the second round had issues with data structure selection, leading to potential rejection or additional rounds.

During my Google L5 coding interview in Bangalore, I was presented with a complex grid traversal problem that required finding the shortest path while maximizing distance from zombies. The problem was similar to a LeetCode challenge but with unique constraints.

I recently interviewed with Google for a software engineering role, completing a phone screen and three challenging onsite DSA rounds. Despite strong performance in most rounds, I ultimately received a rejection, believing my second DSA interview was the deciding factor.

I interviewed for a Software Engineer L3 position at Google Europe and received very strong feedback across all rounds, leading to the team matching phase. While I was considered for L4, I ultimately proceeded with L3.

Had a Google ng code interview experience where I faced a classic problem on subarray sum equals K, showcasing the importance of understanding prefix sums and hash maps for optimization.

I had an onsite interview for the SRE role at Google, where I was tasked with designing and implementing file system utility functions, including a crucial follow-up to delete an entire directory tree.

I interviewed for an L4 Software Engineer role at Google Poland, going through a comprehensive process including technical and behavioral rounds. Despite feeling positive about my performance, particularly in problem-solving and coding, I was ultimately rejected without specific feedback, which left me disheartened.

I recently underwent a Google L3 Technical Phone Screening where I was presented with a unique problem involving matching digits from a Pi sequence to their corresponding indices. The problem required careful handling of single and multi-digit index matching rules, and I discussed the approach and some initial challenges with the interviewer.

I interviewed for a Google Apprenticeship SAD role, which included an Online Challenge with two DSA questions and a phone call. Despite solving the coding problems effectively, I was ultimately deemed ineligible for the role due to my current student status, as it's intended for degree holders seeking a career shift.

I interviewed for a Google Software Engineer New Grad position in India, consisting of two DSA rounds. Despite successfully solving both problems, I was not selected, largely due to a challenging and dismissive first-round experience.

I interviewed for an L4 AI/ML role at Google, clearing the phone screen, DSA, AI/ML, and GnL rounds. I am currently awaiting team matching and a push to the Hiring Committee, but I'm feeling a sense of rejection already.

I recently completed two rounds for Google's Software Development Apprenticeship program 2026. The interviews focused on DSA and 'Googlyness' questions, both of which I felt went well, and I am currently awaiting the results.

I had a phone screen for a SWE SRE role at Google in Dublin, which involved solving several prime number-related algorithmic problems, including designing an algorithm for 'supercut' prime numbers and implementing an optimized Sieve of Eratosthenes.

I recently interviewed at Google, where I tackled a problem involving filesystem handling, specifically calculating directory sizes and discussing optimization strategies within a Python dictionary representation.

I recently interviewed for an L4 role at Google in India and unfortunately received a reject. My experience included a screening round and multiple onsite rounds covering coding, design, and behavioral aspects, with mixed results across different sections.

I recently interviewed at Google for a Web Solutions Engineer position after being contacted by a recruiter. My interview experience included a detailed round focused on DSA, problem-solving, and web technologies, specifically designing a Product Inventory System. Despite presenting an optimal solution and explaining trade-offs, I unfortunately received a lean no-hire outcome.

I interviewed for an L3 position at Google Bangalore, going through several technical rounds covering data structures, algorithms, and system design, along with behavioral questions. The process concluded with a team matching round, which took some time.

I had my first round interview for a Software Development Intern position at Google. I was given a complex Binary Tree problem involving node value manipulation, node swapping, and subtree removal based on the mode. I successfully solved it, achieving O(n) time and space complexity, and also discussed a follow-up question on swapping two numbers.

I recently interviewed at Google for a phone screen, and the main challenge was to implement a restaurant waitlist system.

I had an onsite round interview at Google for an L4 position where I was given a dynamic programming style problem related to electoral votes.

I interviewed for an L4 Software Engineer role at Google Bangalore in April 2025. After navigating through a phone screen, multiple DSA rounds, and a Googlyness assessment, which involved numerous reschedules, I unfortunately faced rejection, resulting in a 12-month cooldown period.

I interviewed for an L4 position at Google via phone and was rejected. I tackled a geometric problem involving finding squares from 2D coordinates but couldn't optimize my solution as requested.

I participated in an onsite interview at Google in the US, where the main challenge involved a complex graph traversal problem focused on counting lakes within an island grid under specific conditions.

I interviewed for a Google University Graduate position, successfully navigating the first DSA round with a graph and string problem, but unfortunately struggling with a Coin Change variation in the second round, which likely led to my rejection.

I underwent a challenging and protracted L4 interview process at Google India, which included multiple coding and behavioral rounds, several reschedules, and ultimately resulted in a rejection despite initial positive feedback and assurances of an offer.

I had a phone screen for an L3 role at Google in the USA where I was presented with a problem involving mapping IP addresses to their most specific prefix, which I failed to solve, leading to my rejection.

I recently completed an onsite interview at Google for an L3 position. The experience involved three distinct technical rounds, each presenting a challenging coding problem focused on data structures and string manipulation.

I recently interviewed for an L4 position at Google. I encountered a problem that was a variation of the 'Partition Equal Subset Sum', which I successfully solved using a 0-1 Knapsack dynamic programming approach.

I had a phone screening interview with Google for an L4 position, where I was challenged with a problem involving stream processing and triplet formation.

I had an L4 onsite interview round with Google where I was presented with a complex maze navigation problem for a blind robot. I provided a brute-force BFS solution, but the interviewer sought a more optimal approach.

I had a Google coding interview where I was challenged to find the number of squares formed by a given set of coordinates, initially with axis-parallel sides and then with any orientation.

I interviewed for a Fullstack L4 position at Google in India, completing three DSA rounds and one Googlyness round. Despite positive feedback on most rounds, I was ultimately rejected due to my performance in one of the DSA rounds where I couldn't optimize a problem with advanced data structures.

I recently had a phone screening interview for an L3 role at Google, where I was presented with two challenging string manipulation problems, both of which I successfully solved.

After completing Google's onsite interviews, the candidate is awaiting final feedback and seeks insights on the timeline for the hiring committee's decision. They had three technical rounds focused on graph problems, with some challenges in time complexity calculations and follow-up questions.

Had my 2nd Google round today with a question about designing 2 APIs for a data stream that returns numbers between the nearest powers of 2 of the current median. Faced challenges with infinite stream constraints and eventually came up with an O(1) space solution with hints from the interviewer.

I cleared the Google L4 phone screen and have my final loop scheduled next week with 4 coding rounds.

I had a phone screen with Google for the L4 SWE III role in Zurich. The interview focused on a merge interval problem, similar to LeetCode #56, but with a unique twist. Despite my best efforts, I performed poorly. However, I wanted to share the question type to help others prepare.

I secured a Fullstack L4 role at Google after a rigorous interview process that included multiple technical rounds, a Googlyness round, and a team-matching interview. The outcome was a positive hiring decision with an offer accepted.

I had a Google interview experience as a university graduate in 2026. I went through three rounds of interviews, including two technical rounds and one technical + Googliness round. Despite feeling confident after the final round, I received a rejection and no detailed feedback.

I experienced a four-round interview process at Google, which included three challenging coding rounds focused on graph algorithms, data stream manipulation, and string processing, alongside a Googleyness behavioral round. While some coding problems were tough, I felt I performed well in others and approached the behavioral questions confidently.

I interviewed at Google for an MLE-III role in Hyderabad, India, in 2025. Despite performing well in the first coding round, I was unfortunately rejected after the second coding interview.

Interviewed at Google for a L4 position. The interview focused on a problem where I had to find a solid square of 1s in a matrix, returning its coordinates and size. The expected time complexity was O(m or n).

I interviewed for an L4 Software Engineer role at Google in India, completing the process over approximately four months. The interview rounds included a phone screen focusing on expression evaluation, an onsite round on designing a BookManager class, and a Googleyness round for behavioral assessment.

I interviewed for a Google SWE Internship, successfully passing the first technical round which involved a string and unordered map problem. The second round presented a more complex variation of the median of a data stream problem on subarrays, which I eventually solved but was ultimately rejected due to taking too much time and perceived nervousness. I learned the importance of confidence and careful reading of questions.

I interviewed for a Google SWE Internship, successfully navigating the initial HR chat and a technical round involving string manipulation. However, I was ultimately rejected after struggling with a complex variation of the 'Median of a Data Stream' problem during the second technical round.

I had a phone screen for an L3 role at Google Bangalore where I was asked a graph reachability problem involving a corrupted node. I suggested a BFS approach and coded it, but received a rejection with feedback mentioning a brute-force approach.

I interviewed for a Google Summer Internship 2026. After an Online Assessment and two technical rounds, I was unfortunately rejected.

I had an initial screening round at Google where I was asked the Longest Duplicate Substring problem.

This post details an online assessment experience for a Google Summer Intern role in 2026, which included two distinct algorithmic challenges: 'K Criss-Cross' and 'Bits Transformation'.

I successfully cleared the Google L3 SWE interview process after several technical and behavioral rounds, ultimately receiving a strong hire feedback and an offer. The entire process, from initial contact to offer, spanned approximately six months.

I recently completed the first round for a SWE III ML position at Google in Bengaluru, which was a Data Structures & Algorithms coding interview. I was presented with two questions, an initial problem and an advanced follow-up, and shared my approaches for both.

I interviewed at Google for an L5 role in India but was rejected after the DSA rounds. Despite what I perceived as relatively easier questions, I struggled with effectively explaining my thought process and handling interviewer interactions. The overall hiring process was notably slow, spanning over a year.

I interviewed for an L4 SDE position at Google in India, completing a phone screen and three onsite rounds. While I solved most problems, I have mixed feelings about the outcome, especially after struggling with a follow-up question, and I'm not expecting positive feedback.

I interviewed for an L4 position at Google, completing a pre-screening and three onsite rounds. The interviews covered API implementations for restaurant table allocation and a chat system, an IP address to city mapping problem, and a modified greedy/knapsack type question. I was rejected after the third onsite round.

I had an onsite interview for an Early Career II role at Google in the US, which included a phone screen and two onsite interviews with specific data structure and algorithm questions.

I shared my Google SDE-3 interview experience, which included a screening round with an API concurrency problem and follow-up, followed by three Data Structures & Algorithms rounds covering specific LeetCode problems and an Object-Oriented Design question, with my result still pending.

I had an onsite interview experience with Google which involved four rounds primarily focused on Data Structures & Algorithms. Despite passing some rounds strongly, I was ultimately rejected after failing to provide an optimal solution in the final technical round.

I had a phone screen interview for an L4 role at Google where I was asked to merge two screenshots. I initially misunderstood the problem and later struggled to optimize my brute-force solution, ultimately leading to a rejection.

This post details the two algorithmic problems encountered during my Google SWE Intern 2026 Online Assessment.

I interviewed for an SWE L4 role at Google. After multiple coding, Googlyness, and team-fit rounds, despite positive feedback on coding, the position was ultimately filled internally, and I did not receive an offer.

I interviewed for a Google SWE II (L3) position, which focused on recursion and tree traversal. I successfully cleared the interview, but the hiring process is currently on hold due to a freeze.

I recently interviewed for an L4 MLE role at Google India. Despite clearing the phone screen and one DSA onsite round, I received negative feedback on the second DSA and ML rounds, ultimately not securing the position.

I had a Google interview experience for a Software Engineer 2 (L3) role, which included a phone screen, three DSA rounds, and a Googlyness round. Despite positive feedback on some rounds, my overall packet was deemed weak, and I did not proceed further.

I participated in a Google screening round in June 2025, lasting 45 minutes, where I was presented with a graph problem. My approach involved Dijkstra’s algorithm to precompute shortest paths and then binary search for queries, but I received no feedback post-interview despite follow-ups.

I interviewed for an L5 Staff Software Engineer role at Google with over 8 years of experience. Despite passing the qualifying round and solving problems in subsequent rounds, I ultimately received a 'No Hire' for both L5 and L4 positions. The interviews covered topics from HashMap internals and expression evaluation to interval management and concurrent user counters.

This post details a Google virtual interview question focused on determining precise player rankings in a chess tournament using graph theory, providing a comprehensive problem description, examples, constraints, and detailed algorithmic approaches.

This post describes a challenging algorithmic problem frequently asked in Google interviews, involving cost-effective operations to make integers divisible or not divisible by 3.

I successfully navigated the Google SRE-2 interviews in Warsaw, ultimately receiving an offer after several challenging rounds, including behavioral questions and advanced data structures and algorithms problems.

I experienced a Google Phone Screening for an L4 role where I was asked to implement an iterator for decoding a string based on a given tree structure.

I interviewed for a Google L3 (SDE-II) role in India, completing 5 rounds including technical and a G&L round which turned into a technical one. Despite strong performance in most rounds, I was ultimately rejected due to negative feedback on the last two interviews.

This post compiles a list of coding and system design questions reportedly asked at Google for L3 and L4 level positions, gathered from various discussions.

I experienced an L4 Googleyness round at Google India, which involved 6-7 behavioral questions focused on past experiences. The interview was completed within 30 minutes, and I extended it with questions about culture.

I interviewed for a Staff Software Engineer role at Google, facing three technical rounds covering system design, concurrency, and tree traversal with string search. Unfortunately, I was rejected, particularly struggling with the first round's concurrency implementation.

I had a phone screening interview with Google for an L4 position. The round included a code output analysis question and a DSA question involving forming a target word from dictionary prefixes and suffixes. I was selected for onsite interviews.

I interviewed for an L4 position at Google in India. The interview focused on a single Data Structures & Algorithms problem involving counting "buddy pairs" of strings, which required understanding circular character differences and efficient data structures. I discussed brute force, Trie, and an optimized hashmap/shifted string approach, which I then coded.

I interviewed for a Software Engineer III role at Google, undergoing a phone screen and four onsite rounds covering data structures, algorithms, and behavioral questions. Despite identifying key approaches for some problems, I struggled with optimization and converting insights into efficient solutions, ultimately leading to a rejection with feedback on problem-solving and time efficiency.

I had an onsite interview for a Google L4 role, where I faced a challenging geometry problem requiring me to find a vertical line dividing total area of non-overlapping rectangles. Despite identifying an optimized approach and writing code, I missed edge cases due to time constraints, and I am currently awaiting feedback.

I experienced a friendly and conversational L4 onsite interview at Google India, where I was presented with a coding challenge to implement an image gallery's getNext() function, focusing on handling favorites first.

This post describes a specific coding question encountered during a Google L4 onsite interview, emphasizing the importance of clarifying assumptions about input properties.

I recently had an onsite coding round at Google where I was presented with a matrix-based problem to count enclosed 'lakes' formed by zeros within land areas (ones). My verdict was 'No Hire' (NH), as I noted forgetting to handle edge cases in my solution.

I had a telephonic interview for a Google E4 role where I was asked to solve a problem involving finding the maximum sum of a contiguous subarray with equal start and end elements.

I had virtual onsite interviews for a Google SDE L3/L4 role in Taipei, Taiwan, consisting of three technical rounds. I received mixed feedback, passing most rounds but failing one coding interview, which resulted in a 6-month re-application period.

I underwent a screening interview for a Google L4 role where I was presented with a problem on robot navigation and circular sensor traps. I successfully solved it and was selected for the on-site rounds.

I detail my 5-month-long Google L4 interview process for Pune/Hyderabad, covering multiple coding rounds and a Googleyness round. Despite successfully solving several algorithmic problems and receiving positive feedback on some rounds, I was ultimately rejected.

I successfully interviewed for a Software Engineer L4 role at Google India, and after a 4-month process, I will be joining as SDE III. The experience involved multiple coding rounds focusing on data structures and algorithms, along with a behavioral 'Googlyness' round.

I interviewed for an L4 role at Google in India, undergoing 4 onsite rounds including DSA, system design, and behavioral questions. Despite mixed feedback, my profile is being moved forward for team matching.

This post details a specific Online Assessment (OA) question from Google, focusing on minimizing the diameter of a tree by performing at most k leaf deletions.

I participated in a Google L4 screening round. I was presented with a problem involving processing a stream of messages and implementing logic to prevent printing duplicate messages within a specific time window, including a follow-up condition.

I underwent a Google L3 interview process which included a phone screen, two onsite technical rounds, and a Googlyness round. Despite some positive feedback, negative outcomes in the second technical round and the Googlyness round led to my rejection and a 12-month cooldown period.

I experienced a protracted and emotionally draining hiring process for an L3 position at Google, which included numerous reschedules, multiple technical rounds, a behavioral interview, an additional coding challenge, and a team matching call, ultimately concluding with a rejection after several months of delays and communication gaps.

I recently went through a Google interview process which included a mock interview and three subsequent coding rounds. The problems covered various aspects of data structures and algorithms, ranging from array manipulation and graph cycle detection to log stream processing and graph reachability within specific time constraints.

I recently received an offer for the L4 Software Engineer role at Google India after a structured and challenging interview process that included four technical rounds and a behavioral round, sharing my journey and learnings.

I interviewed for an MLE L4 position at Google in Hyderabad, consisting of 5 rounds including Phone Screen, two DSA rounds, Googlyness & Leadership, and an ML Domain round. The interviews were coding-heavy, and despite not expecting a positive outcome, I performed better than my own expectations, gaining valuable insights for future preparation.

I had a phone screen interview with Google where I was asked a Data Structures & Algorithms question and a system design follow-up. I received positive feedback and moved to the on-site round, eventually receiving a down-leveled offer.

I completed a phone screen and four onsite rounds for a Google L3 position, but was ultimately rejected despite feeling the questions weren't hard.

I had a phone screen round for Google L4 in the US, where I solved a binary tree pathfinding problem, and I cleared the round.

I was asked to implement a class for a union of ranges during my Google L5 screening interview.

This post details a specific question encountered during a Google Online Assessment (OA).

I shared my experience interviewing for an L4 role at Google, detailing multiple rounds that were generally positive and collaborative, although I sometimes struggled with optimal solutions or advanced follow-up questions. I received positive feedback despite some noted areas for improvement.

I successfully interviewed for a SWE L3 role at Google, navigating through several problem-solving and behavioral rounds. After a successful team matching process for a backend role, I received an offer.

I successfully navigated a multi-round interview process with Google for an L4 position in India, culminating in a job offer. The process involved a phone screen, three onsite technical rounds, a Googlyness round, a hiring manager round, and team matching.

I interviewed for an L4 position at Google in Bengaluru, successfully navigating a phone screen, three challenging onsite technical rounds, and a behavioral conversation, which ultimately led to an offer.

I completed my onsite interview for an L3 role at Google and am sharing the questions, though I am unsure about the outcome and believe I may need to look for other opportunities.

I had an interview experience at Google Bengaluru for an MLOps L5 role. The process involved a telephonic screen and four on-site rounds covering data structures, algorithms, and system design, concluding with a reject.

I had a phone screen interview for Google L4, where I was asked a game theory problem involving card picking. Despite the problem being standard, I fumbled and do not expect to proceed to further rounds.

I interviewed for a SWE III ML - L4 role at Google in May 2025 and had a positive experience, moving to team match after completing a Phone Screen and several Onsite rounds covering Data Structures & Algorithms, System Design, and Behavioral questions.

I completed six technical interview rounds for a New Grad position at Google India, performing well on most questions but still awaiting a final decision due to staggered hiring for the 2025 batch.

I interviewed for a TPS L3 role at Google in India and successfully cleared the round, though a company-wide hiring freeze means the onsite interviews are currently delayed by a month or two.

I had a frustrating Google L4 screening interview marked by poor communication, an ambiguous problem, and conflicting explanations regarding parallel execution. This led to confusion and inefficient solutions, ultimately resulting in a 'No Hire' verdict citing poor problem-solving.

I bombed my Google onsite interview due to nervousness, struggling with a hashmap problem involving time-based entry removal.

I interviewed for an SDE 3 position at Google in Bengaluru, sharing detailed questions from multiple rounds. Despite my efforts, I was ultimately rejected due to negative feedback on one of the technical rounds.

I interviewed for an L4 role at Google in Bangalore. After passing the screening and three coding rounds, and a behavioral round, I was ultimately rejected due to feedback on coding speed and edge case handling.

I experienced a challenging phone screen at Google India for an L4 role where the interviewer was uncooperative, providing minimal information for a difficult problem, which I eventually solved within the given time constraints.

I had a phone screening round with Google, where I was presented with a unique data structures and algorithms question regarding binary search in an unsorted array.

I interviewed at Google India for an L4 role, completing 5 rounds including a phone screen, three technical rounds, and a Googlyness round. Despite feeling that most rounds went well, particularly my solutions for the first and third technical questions, I was ultimately rejected after two weeks. I plan to reattempt after the cooldown period.

I experienced a technical coding round at Google for a Test Engineer role, focusing on graph theory and DFS. The interview, which was medium difficulty, heavily emphasized optimizing my solution and discussing complexity, which I felt went well.

I successfully navigated multiple challenging interview rounds at Google for an L3 position, overcoming anxiety and multiple reschedules, and eventually securing a team after a prolonged process.

During a Google L4 interview, I was presented with a variation of the 'Number of Islands' problem, adapted for a binary tree structure.

I had a Google phone interview for an L4 role, where I was tasked with finding the most frequent word immediately following a given word in a 2D array of phrases. Although I couldn't complete the full implementation due to time constraints, I was offered a second phone round.

I interviewed for an L4 position at Google for their Hyderabad/Pune locations. The process included a phone screen and three onsite rounds, focusing on Data Structures and Algorithms. Despite receiving mixed feedback on my solutions and speed, I found the questions mostly approachable and gained valuable insights for future interview preparation.

I had an onsite interview round at Google where I encountered a challenging geometry problem about finding the largest rectangle from a given set of points.

I interviewed for a Senior Software Engineer role at Google in Bengaluru, which resulted in a rejection after two DSA rounds. Despite a negative outcome, I've gained valuable learning from the experience.

I interviewed for a Software Engineer III position at Google in Hyderabad, completing a telephonic screen, three onsite technical rounds, and a 'Googlyness' behavioral round. Despite solving most problems, I was ultimately rejected.

I had a phone screen interview with Google for an L4 role, where I was asked to design a custom Deque using only a HashMap. Despite performing well and impressing the interviewer, I was unexpectedly rejected without specific feedback.

I interviewed for an L4 position at Google, completing two preliminary screening rounds and four onsite rounds covering DSA and Googlyness, ultimately receiving an offer after two team matching calls.

I participated in an onsite interview for Google L3 where I was presented with two data structure and algorithm problems. I successfully solved a problem involving merging changelog files with version conflict resolution and a follow-up problem to parse changelog file content into a structured format.

I attended a preliminary interview at Google and was presented with a problem to group elements based on common properties.

I interviewed for an L4 role at Google in Bangalore, experiencing multiple rounds including a phone screen and several onsite rounds. My performance was mixed, with some rounds going well and others presenting difficulties, ultimately leading to a rejection for L4 but an offer for an L3 role, which I declined.

This post provides the two algorithmic questions encountered during a Google SDE1 Online Assessment.

I interviewed for an L4 position at Google, completing a phone screen and four onsite rounds. Despite providing solutions for most technical questions, I don't believe I will be moving forward this time, possibly due to ghosting or ongoing hiring freezes.

I had my first onsite round with Google for an L4 position. I was asked to build a program for string substitution with variable references, including a follow-up on cyclic references, which I mostly solved recursively.

I'm sharing two Data Structures and Algorithms questions I was asked during my interviews at Google, although I unfortunately failed to solve them.

I participated in a 45-minute technical screening round for the Google Early Career program, focusing on collaborative problem-solving and in-depth discussion of approaches before coding. I implemented a restaurant waitlist management system but realized post-interview that a more optimal O(1) solution was possible.

I was asked a ranking problem in my onsite second round. I correctly outlined the approach but only partially coded the solution.

I had an initial phone screen round for a Senior SDE-3 position at Google, where I was asked to design a central elevator management system.

I participated in two onsite rounds for a Google L4 position in the USA, where I tackled specific algorithm and data structure problems. Despite some initial missteps in my solutions and complexity analysis, both rounds were positively received, and I successfully passed the Hiring Committee.

This post details my Google L4 onsite interview experience, which involved solving a graph connectivity problem using Union-Find to determine when a grid's first column connects to its last.

I had a phone screening at Google for an L4 role in April 2025 where I was asked to design an algorithm for managing birthday reminders in a family tree.

I had a phone screening for a SWE L4 position at Google, where I was asked a question about active tickets within a time range. Despite coding and explaining my approach, I received negative feedback.

I had a phone screen on 08/04 for an L3 position at Google and was asked a graph problem about finding a path between airports considering flight timings. I successfully cleared this round and am awaiting contact from a new recruiter for the next steps.

I was hired for a Senior Software Engineer (L5) role at Google India after an interview process that included three Data Structures & Algorithms rounds, one System Design round, and one Googlyness & Leadership round, receiving positive feedback on all technical assessments.

I interviewed for an L4 position at Google in Hyderabad, completing a phone screen and two onsite rounds that involved a complex linked list problem and two LeetCode-style questions.

This post details a comprehensive list of technical and behavioral questions encountered in a Google New Grad off-campus interview, targeting candidates for 2025 in India.

I successfully completed an L3 interview at Google Bangalore, received positive feedback from the hiring manager, and ultimately secured an offer after team matching.

I experienced an onsite interview round at Google which involved a detailed problem on implementing an auto-complete feature for street names.

I had a phone screening for an SDE2 role at Google where I was asked to implement a movie recommendation system based on transitive similarity. I was rejected due to nervousness, mixing up syntax, and using the wrong heap type.

I had a phone screen for an SRE-2 role at Google in Warsaw. The interviewer was friendly, and I was given a problem based on 'Kth Largest element in a data stream', which I successfully solved and discussed follow-up questions. I was later selected for onsite interviews.

I experienced a phone screening round with Google for an L5 position and was presented with a sequence merging problem, which I solved using topological sort.

I experienced a Google L3 phone screen round where I was given a problem similar to LeetCode's 'Move Pieces to Obtain a String' with a follow-up. I solved the initial part but ran out of time on the follow-up, ultimately leading to rejection.

I successfully cleared the Google L3 interviews in India, receiving an offer despite my current compensation being higher. The interview process spanned several months and included unexpected questions beyond typical DSA problems, such as estimation and design and test rounds.

I had a phone screen for an L4 role at Google where I was asked to find indices of ranges where a number lies. I was only able to provide an O(n*maxRange) approach and believe I will be rejected.

I experienced a Google phone screening for a PhD early career role in the USA. I encountered a variation of the Basic Calculator I problem, where numbers were replaced by letters, and I struggled to solve it within the time limit.

I interviewed for an L3 role at Google India and, despite positive feedback and team matching, I was rejected by the Hiring Committee due to hints taken in one round. I have 1.8 years of experience.

I applied for an L5 position at Google India via referral, undergoing three coding rounds with a mix of Leaning Hire and Leaning No-hire verdicts, ultimately leading to a potential downlevel offer to L4, which I plan to decline.

I applied to Google India for an L4 role and after a lengthy interview process involving a screening, three onsite rounds, and a Googlyness round, my application advanced to the team matching phase. Despite positive feedback on most rounds, the process was described as tiresome due to multiple reschedules.

I was asked a challenging optimization problem about ice cream sellers and kids, requiring finding a minimum range for sellers to cover all kids. I initially provided an O(nklog(max-min)) solution and later thought of an O(nlogK) improvement.

I had a second round interview at Google for an L5 position, where I was asked two parts of a string prefix matching problem. I discussed binary search and Trie-based approaches, identifying a minor bug in my initial solution.

I had a disappointing screening round with Google where I struggled to understand and solve a complex string parsing problem, despite extensive DSA preparation.

I participated in a phone screen interview round with Google, where I was tasked with evaluating a given mathematical expression.

I had a telephone screen with Google for an L4 role where I was presented with the 'Linear Chess' problem.

I had my Google phone screen at the end of March for an L3 position, where I was presented with a graph problem similar to LeetCode's Minimum Weighted Subgraph, adapted for an undirected and unweighted graph, along with a follow-up about multiple friends reaching a destination.

I had a phone screen for a Google SWEIII (L4) role, where I was given a problem to find the first failing commit in a range and multiple follow-up questions exploring optimizations using binary search, multithreading, and parallel API calls. Initially, the recruiter informed me they would not proceed, but later offered a second phone screen opportunity.

I experienced a Google L3 interview which included a technical phone screen and a 4-round onsite. Despite some challenges and self-perceived difficulties, I provided my self-verdicts for each round and anticipate mixed feedback.

I interviewed with Google for a SWE-II role in India as a fresher and successfully received an on-campus offer after multiple technical and Googlyness rounds.

I recently completed my onsite rounds for a Software Engineer L3 position at Google. I encountered several data structures and algorithms problems, performing well on most, but struggling slightly on a follow-up for one question. I am currently awaiting feedback from the recruiter.

I recently had an interview round at Google where I was presented with a very challenging maze problem requiring universal instructions to exit from any starting position, and I derived a solution approach with some interviewer hints.

I interviewed for a SWE-3 role at Google, completing 3 technical rounds and 1 Googleyness round. The result is not out yet, but I found the interviewers very helpful and plan to prepare strategically for a future attempt.

I had a phone screen round with Google India for an L3 role where I was asked a hard graph problem. My proposed solution's time complexity was not entirely satisfactory to the interviewer, leading to uncertainty about progressing to further rounds.

I had a phone screen round for Google L4, where I was asked a challenging log message truncation problem which I approached using binary search to find the optimal 'X'.

I underwent a Google L3 onsite interview which included multiple Data Structures & Algorithms and behavioral rounds. Despite mixed feedback, including a negative on one DSA round, my recruiter is forwarding my packet, though I perceive the chances of selection as low.

I had a disappointing Google SDE II interview experience in Bangalore, where the interviewer seemed distracted and potentially biased, leading to a "Neutral" feedback and a 12-month cool-off despite my strong preparation and confidence in my solution.

I had a Google mock interview for an SDE II (L4) role in Bangalore. The session focused on a core graph problem concerning organizational structure and employee scores, followed by two challenging follow-up questions on efficiently recomputing scores after individual or subtree team movements.

I successfully navigated my Google L4 interview process, receiving positive feedback across all phone screen and onsite rounds, ultimately culminating in an offer.

I experienced a Google phone screen where I tackled a dynamic programming problem focused on finding the maximum nesting level for a given set of rectangles. After an initial brute-force attempt, I recognized the DP pattern, successfully implemented a memoized solution, and discussed its complexities.

I appeared for a Google L5 interview in January 2025 and was asked a series of challenging Data Structures & Algorithms questions across multiple rounds, including scheduling, graph theory, and range management problems.

I recently had a phone screen interview for a Software Engineer role at Google India, Bangalore. I was asked a backtracking problem similar to 'Generate Parentheses', but I couldn't complete the code within the time limit due to a lack of confidence and experience. I am currently awaiting feedback on my performance.

I recently interviewed for an L5 Staff Software Engineer role at Google. Despite putting in significant preparation and clearing the initial rounds, I was ultimately rejected after struggling with the second onsite technical interview. I'm sharing my experience and the specific questions I faced to help others preparing for similar roles.

I recently completed a 45-minute screening round for an SE-3 role at Google India. Despite missing a specific edge case, my logical approach and timely coding of a stream processing problem, similar to a configurable Top K, were well-received, and I was informed that I would be proceeding to the next interview rounds.

I successfully interviewed for an L4 Software Development Engineer position at Google in Hyderabad, India, securing an offer after a series of phone screen, technical, and Googleyness rounds.

After a comprehensive and protracted interview process at Google for an L4 Software Engineer position, which included multiple coding and behavioral rounds, as well as additional technical assessments after an initial hold, I successfully secured and negotiated an offer.

I completed a phone interview with Google for an L3 position, successfully clearing the technical round. However, despite being told I would proceed, the recruiter subsequently ghosted me, leaving the process unresolved.

I recently interviewed for an L5 Software Engineer role at Google and successfully received an offer. Despite facing challenging rounds, including two with 'Lean Hire' verdicts, I managed to convince the Hiring Committee and secure the position.

I interviewed with Google for a Software Engineer, University Graduate role for the 2025 cohort and unfortunately received a rejection after multiple challenging technical and Googliness rounds. Despite the outcome, the entire experience was incredibly valuable, teaching me resilience and enhancing my problem-solving skills.

I underwent a Google Summer Internship interview process, which included a technical round featuring a variation of the 'Buy and Sell Stock' problem. Despite my clear approach, I faced challenges with implementation under time pressure and technical issues, leading to a rejection.

I interviewed for an L4 position at Google, completing a phone screening and four onsite rounds over a few months. I felt I performed strongly in several technical and behavioral rounds and am currently awaiting the final outcome.

I recently had a phone screen interview with Google for the SWE3 position in Bangalore. During the interview, I was presented with a challenging string manipulation problem involving index matching.

I recently interviewed for an L4 position at Google. Despite successfully solving and coding all technical problems, and receiving positive feedback on most rounds, I was ultimately rejected. This was my best interview performance to date, making the outcome quite disheartening.

I recently completed an on-campus SDE interview process at Google, which involved three rigorous technical rounds. The interviews focused on my problem-solving skills across data structures, algorithms, and a behavioral assessment.

I interviewed for a Software Engineer (L3) role at Google, India. After successfully clearing the screening round, I proceeded to onsite interviews. Although I performed strongly in several technical and behavioral rounds, I struggled in one and ultimately my application was rejected after reaching the team-matching phase.

I successfully interviewed for an L4 position at Google, navigating through several challenging technical rounds focusing on algorithms, data structures, and system design, ultimately receiving an offer and joining the Google Hyderabad office.

I was rejected for the Staff SDE role at Google, Hyderabad, primarily due to my performance in the second system design round.

I recently interviewed for an L4 Software Engineer role at Google in the USA. The process involved multiple coding rounds, an OOP design interview, and a behavioral round. Despite some strong performances, I was ultimately rejected after being considered for a downlevel, as there was no L3 headcount available in my area.

I had a phone screen with Google for an L4 position and unfortunately, I was rejected. The interview focused on designing a custom data structure for a string-based binary tree and a follow-up to find the Nth character.

I interviewed for an Application Engineer Intern position at Google, successfully navigating a DSA round with two specific tree problems and a System Design round focused on designing an e-commerce website. Despite my efforts, I was ultimately not selected for the role.

I experienced three rounds of interviews for a Software Engineer New Grad position at Google, covering technical skills and Googleyness. I felt some rounds went better than others, and I am currently awaiting the final results.

I interviewed for a Software Engineer L3 role at Google India. Despite initial recruiter delays and a challenging "Googlyness" round, my technical interviews went well, and I received a "go ahead" on my profile.

I recently interviewed for an L3 role at Google in the USA, navigating through a phone screen, a Google & Leadership round, and three challenging technical rounds.

I interviewed with Google for a technical role on September 2nd. The 45-minute session involved two challenging binary tree problems. Although I was not selected for the next rounds, the experience was a valuable learning opportunity that significantly boosted my confidence.

I recently went through the L3 early career interview process at Google in the USA, which comprised a phone screen and a virtual onsite, covering coding, system design, and behavioral aspects.

I interviewed for an L4 Software Engineer role at Google, enduring a lengthy 6-month process across multiple technical and behavioral rounds. Despite performing well in most interviews, my application was ultimately rejected due to not meeting the strict 3-year experience criteria at the final stage.

I recently had a phone screen interview with Google in July 2024. The main focus was a challenging coding question that required grouping objects based on shared properties.

I successfully navigated a rigorous 6-month interview process for a Senior Software Engineer (L5) role at Google, ultimately receiving an offer after multiple coding rounds, a system design interview, and a behavioral 'Googliness' round, despite several challenges and follow-up rounds.

I successfully navigated the Google L4 interview process, which included a screening round, four onsite technical rounds, and a Googleyness round, ultimately receiving an offer.

I recently encountered a challenging Google problem that focused on efficiently assigning support questions to a team of volunteers based on their tag specializations.

During my Google onsite interview, I was presented with the classic Word Break problem, which I successfully solved using dynamic programming.

This post describes the 'Longest Increasing Subsequence' problem that I encountered during my Google onsite interview, complete with problem statement, examples, and a detailed solution approach.

I encountered the Robot Room Cleaner problem during my Google onsite interview, which involved using a DFS approach to navigate and clean a grid.

I recently participated in an onsite interview with Google where I was tasked with solving the 'Longest Consecutive Sequence' problem, a classic algorithm challenge.

I interviewed at Google India for an L3 Software Engineering role in April 2024. Despite performing well in some rounds and optimizing solutions, I was ultimately rejected, primarily due to my performance in a system design round and an ad-hoc array coding problem.

I underwent a Google phone screen where the HR representative focused on my background, DSA familiarity, project experience, and career aspirations through a series of behavioral and screening questions. Despite my detailed responses, I received a rejection email on the same day as the interview.

I interviewed for an SDE L4 role at Google and underwent preliminary screening followed by two on-site rounds. Despite coding solutions for all questions, I was ultimately rejected for the L4 position.

I recently experienced an online interview with Google, where I successfully navigated the 'Maximum Subarray Sum' problem by implementing Kadane's algorithm.

I successfully navigated the Google SDE II (L3) interview process in India, which spanned three months from initial recruiter contact to receiving an offer. My journey included a phone screen, four challenging onsite Data Structures & Algorithms rounds, and a crucial Googleyness behavioral interview.

I had a phone screening interview with Google for an L3 role where I was presented with a challenging graph/geometry problem related to message spreading.

I recently took an online assessment for Google in 2023, where I was presented with a challenging dynamic programming problem focused on counting special subsequences with specific properties.

I had my first of two interview rounds with Google for a SWE role. This post details my experience from Round 1, which included a technical problem focused on minimum cost transactions from streamed inputs, alongside several behavioral (Googliness & Leadership) questions. I hope this helps others prepare.

I successfully navigated the Google SDE interview process in July 2023, ultimately receiving an offer despite an initial hiring freeze. The interviews included multiple challenging technical coding rounds, a behavioral discussion, and a Googlyness/puzzles round, where I demonstrated my problem-solving and communication skills.

I interviewed for an SDE 1 role at Google and successfully solved two LeetCode problems, Reverse Integer and Next Permutation, in the first round. I am currently awaiting feedback.

I had my first round interview at Google where I was asked to implement a function that formats a list of strings into a table based on a maximum line width constraint.

I interviewed for a Software Engineer Intern position at Google in September 2022. Despite performing well in the first technical round, I struggled significantly with a hard dynamic programming problem in the second, ultimately leading to a rejection.

I successfully received an L4 Software Engineer offer from Google India after a series of interview rounds, including a phone screen, three technical onsites, and a behavioral round.

I interviewed for a Software Engineer position at Google, undergoing multiple coding rounds and a behavioral assessment. Despite performing well enough to receive 'Leaning hire' ratings in my technical rounds, I was ultimately rejected. Although offered reconsideration, I withdrew from the process after accepting an offer from another company.

I recently interviewed onsite at Google, where I encountered a challenging data structures and algorithms problem. The core task involved identifying the longest possible chain of words based on specific rules for word transformation.

I recently interviewed for a Google L4 position in Bangalore and successfully received an offer. The interview process spanned over two months and included a phone screen, four coding onsite rounds, and one 'Googlyness' behavioral round.

I recently completed a Google L4 phone screen where I encountered a challenging variation of the Longest String Chain problem, specifically requiring the chain to begin with a single-character word.

I encountered a challenging problem during my Google onsite interview that involved simulating a message broadcast and router shutdown scenario within a wireless network.

I recently participated in virtual interviews for a Software Engineer - Full Stack role at Google India, which consisted of three technical coding rounds and one behavioral round focusing on situation-based questions.

I successfully navigated multiple coding and behavioral rounds for an L4 Backend/FullStack role at Google in Bangalore, ultimately receiving an offer. My journey involved overcoming an initial setback from a previous Google interview and rigorous preparation in Data Structures and Algorithms.

I had an onsite interview at Google where I tackled several algorithm problems similar to those on LeetCode. Despite the problems not being exact matches, the links I provided convey the type of challenges I faced. I was successful in my interview and received an offer.

I had a two-stage interview process for a Data Scientist role at Google in Zurich, consisting of a recruiter call and a technical phone screen. Despite performing well in data intuition and coding, a deep dive into Bayesian statistics led to my rejection after the first technical round.

I successfully interviewed for an L3 Software Engineer position at Google in Bangalore, navigating through 4 technical rounds and a Googliness assessment, which ultimately resulted in receiving an offer.

I interviewed for an L3 New Grad Software Engineer position at Google in February 2022. The process involved a phone screen and two onsite rounds, covering Data Structures & Algorithms and a 'Googlyness' behavioral segment. Despite the interviewers not being as friendly as expected, I found the overall interview process to be well-structured and an interesting experience.

I interviewed for a Software Engineer L3/L4 role at Google Bangalore in late 2021, undergoing seven challenging technical and behavioral rounds over two months. Despite receiving positive feedback in some rounds and making it through additional committee-requested interviews, I was ultimately rejected for both L3 and L4.

I interviewed for an L5 position at Google India in December 2021 and received an offer. The interview process involved 8 rounds, including follow-ups, and emphasized speed, logical problem-solving, and managing ambiguity, even when facing initial setbacks like a no-hire for a syntax error.

I had 5 onsite interviews over 3 days for a Test Engineer position at Google in Warsaw. The rounds covered string manipulations, a variation of Number of Islands, basic testing, and 'Googliness'. I feel my interviews went well and am expecting a positive outcome.

I successfully interviewed with Google in Bangalore, India for an L3 Software Engineer role, ultimately receiving an offer after a comprehensive process spanning six rounds in late 2020 and early 2021.

I successfully interviewed for an L5 Software Engineer position at Google Cloud in Seattle, WA. The process involved a phone screen, a virtual onsite with three coding rounds, a behavioral interview, and a system design interview, culminating in an offer after team matching.

I interviewed for a Software Engineer L4 position at Google in NYC in September 2020. Despite a rigorous interview process involving a phone screen and a five-round virtual onsite, I ultimately received a rejection.

I interviewed for a Software Engineer L4 position at Google in Bangalore and successfully received an offer after multiple technical and behavioral rounds, spanning coding, system design, and leadership principles.

I recently completed an L4 onsite interview at Google, which unfortunately resulted in a rejection. My performance highlighted areas for improvement, particularly in coding speed and optimizing solutions efficiently during the rounds.