Google || Sde - 1 || Interview - Google

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.

Full Experience

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.

Interview Questions (2)

Reverse Integer

Data Structures & AlgorithmsEasy

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: [-2³¹, 2³¹ - 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Next Permutation

Data Structures & AlgorithmsMedium

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.

Google || SDE - 1 || Interview

Summary

Full Experience

Interview Questions (2)

Join the Discussion

No comments yet