Google onsite

Result
Offer
Posted
18 Mar 2022
380 reads

Summary

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.

How it went

My onsite interview experience at Google involved several coding rounds. While the problems I was given weren't identical to specific LeetCode questions, I've shared links to similar problems that represent the core concepts and difficulty level I encountered. It was a challenging yet rewarding process. I'm happy to share that I successfully cleared the interviews and received an offer to join Google, where I've been working for some time now. To everyone currently preparing for interviews, keep pushing forward; your hard work will pay off!

Questions asked (3)

  1. 01

    Race Car

    Data Structures & Algorithms · Hard

    Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into two actions: 'A' (Accelerate) and 'R' (Reverse). 'A': position += speed, speed *= 2. 'R': if speed is positive then speed = -1 else speed = 1, position remains the same. Find the minimum number of instructions to get to a target position.

    Open the problem
  2. 02

    Shortest Path in a Grid with Obstacles Elimination

    Data Structures & Algorithms · Hard

    You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right. If you want to move from a cell (x, y) to (x+1, y), and grid[x+1][y] is 1, you can eliminate this obstacle. You are also given an integer k, which is the maximum number of obstacles you can eliminate. Return the minimum number of steps to walk from (0, 0) to (m-1, n-1) or -1 if it is not possible.

    Open the problem
  3. 03

    Maximum Number of Visible Points

    Data Structures & Algorithms · Medium

    You are given an array points, an integer angle, and a location array [pos_x, pos_y] where points[i] = [x_i, y_i] denotes the position of point i on a 2D plane. You are standing at location and can see all the points in a circular sector. The sector's angle is angle degrees, and its origin is your location. You can rotate this sector counter-clockwise around your location. Return the maximum number of points you can see. Note that points that are exactly at your location should always be counted.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!