google logo
Google· SDE 1

Google || SDE - 1 || Interview

Result
Ongoing
Posted
15 Jul 2023
376 reads

Summary

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.

How it went

I applied for the SDE 1 role at Google through a referral and received an interview call after two months. The first round consisted of two coding questions. I was able to successfully solve both problems. Currently, I am still waiting for feedback from HR regarding the next steps.

Questions asked (2)

  1. 01

    Reverse Integer

    Data Structures & Algorithms · Easy

    Given a 32-bit signed integer, reverse digits of an integer. Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [-231, 231 - 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

    Open the problem
  2. 02

    Next Permutation

    Data Structures & Algorithms · Medium

    Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order). The replacement must be in-place and use only constant extra memory.

    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!