Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Google SDE (Software Development Engineer) Interview Questions, Process, and Tips

Updated 23 Nov 2022

Top Google SDE (Software Development Engineer) Interview Questions and Answers

Google SDE (Software Development Engineer) Interview Experiences

4 interviews found

I applied via Approached by Company and was interviewed in May 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - HR 

(2 Questions)

  • Q1. About years of experience
  • Q2. Current role and expertise
  • Ans. 

    I am currently working as a Software Development Engineer with expertise in web development and cloud computing.

    • Proficient in programming languages like Java, Python, and JavaScript

    • Experience in developing and maintaining web applications using frameworks like React and Angular

    • Knowledge of cloud computing platforms such as AWS and Azure

    • Familiarity with database management systems like MySQL and MongoDB

    • Strong problem-so

  • Answered by AI
Round 3 - One-on-one 

(3 Questions)

  • Q1. Java object oriented questions
  • Q2. Data structures related questions
  • Q3. Given small coding problem on duplicate string

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare leetcode problems mostly, data structures as much as possible hr was very Frank later this round she given preparation time but somehow I got rejected recently I got call again from Google recruiter saying they shortlisted based on my LinkedIn profile so keep good profile that also helps.

I applied via LinkedIn and was interviewed in May 2022. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Time complexity of the program wriitten
  • Ans. 

    The time complexity of the program is O(nlogn).

    • The program has a divide and conquer algorithm.

    • The program has nested loops.

    • The program has a recursive function.

  • Answered by AI
  • Q2. Design the algorithm with less time complexity
  • Ans. 

    Design an algorithm with less time complexity.

    • Use efficient data structures like hash tables, binary trees, etc.

    • Avoid nested loops and recursion if possible.

    • Try to optimize the code by reducing redundant operations.

    • Use dynamic programming to solve complex problems.

    • Consider parallel processing for large datasets.

    • Use built-in functions and libraries instead of writing custom code.

    • Profile the code to identify bottlenecks

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Very difficult only data structures and algorithms

Skills evaluated in this interview

SDE (Software Development Engineer) Interview Questions Asked at Other Companies

asked in Carwale
Q1. A string is given consisting of lowercase alphabets. Write a func ... read more
asked in Carwale
Q2. Given a balance and 100 coins;out of which,one is heavier. Find m ... read more
Q3. Given a binary search tree , print the path which has the sum equ ... read more
asked in Housing.com
Q4. Given a square area of 1024x1024 on a map with some flats (housin ... read more
asked in Carwale
Q5. Delete nodes in linkedlist which have a greater value on right si ... read more

I applied via Approached by Company and was interviewed before Sep 2021. There was 1 interview round.

Round 1 - One-on-one 

(4 Questions)

  • Q1. Questions on Data Structures and time complexities
  • Q2. Merge sort and heap sort describe
  • Ans. 

    Merge sort and heap sort are two popular sorting algorithms used in computer science.

    • Merge sort is a divide-and-conquer algorithm that recursively divides the input array into two halves, sorts them, and then merges them back together.

    • Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements.

    • Merge sort has a time complexity of O(n log n) and is stable, while heap sort has...

  • Answered by AI
  • Q3. Time complexities on sort algorithms
  • Ans. 

    Time complexities of sort algorithms

    • Bubble sort - O(n^2)

    • Selection sort - O(n^2)

    • Insertion sort - O(n^2)

    • Merge sort - O(n log n)

    • Quick sort - O(n log n)

    • Heap sort - O(n log n)

  • Answered by AI
  • Q4. Projects from work current role

Interview Preparation Tips

Interview preparation tips for other job seekers - not just learn algorithm, learn about run time complexities as well

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jul 2021. There were 6 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. BASIC FUNDAMENTAS AND SOME COMPLEX C++ AND JAVA TRAFFIC PROBLEMS
  • Q2. AND I SOLVED ME

Interview Preparation Tips

Interview preparation tips for other job seekers - BE CONFIDENT AND PREPARE WELL

Google interview questions for designations

 SDE

 (15)

 Software Development Engineer

 (11)

 SDE Intern

 (1)

 Software Development Engineer Intern

 (6)

 Software Development Engineer II

 (2)

 Software Development Engineer 3

 (1)

 Software Development Staff Engineer

 (1)

 Software Engineer

 (98)

Interview questions from similar companies

I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Coding Test 

2 Coding Ques + Aptitude

Round 2 - One-on-one 

(1 Question)

  • Q1. Question on Hash Maps

Interview Preparation Tips

Topics to prepare for Amazon SDE (Software Development Engineer) interview:
  • Algorithms
  • Data Structures
Interview preparation tips for other job seekers - Practice Question from Leetcode and Codeforces.

I was interviewed before May 2016.

Interview Questionnaire 

1 Question

  • Q1. Write a program to calculate the sum of level order tree
  • Ans. 

    Program to calculate sum of level order tree

    • Traverse the tree level by level using BFS

    • Add the values of each level and return the sum

    • Use a queue to store the nodes at each level

    • Handle edge cases like empty tree or null root

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Applied through referral and after the review my resume gets shortlisted.

Round: Test
Experience: 6 program and their outputs are given. We have debug the program to get the desired output.
Duration: 11 hours 20 minutes
Total Questions: 6

Round: Test
Experience: Have to write a code for 2 problems.
Duration: 1 hour
Total Questions: 2

Skills: Behavioural Skills, LOGICAL THINKING ABILITIES, Technical Skill

Skills evaluated in this interview

I was interviewed in Aug 2016.

Interview Questionnaire 

3 Questions

  • Q1. A variant of Longest Increasing Subsequence
  • Ans. 

    Find the length of longest increasing subsequence in an array.

    • Use dynamic programming to solve the problem efficiently.

    • Maintain an array to store the length of longest increasing subsequence ending at each index.

    • Traverse the array and update the array for each index.

    • Return the maximum value in the array as the length of longest increasing subsequence.

  • Answered by AI
  • Q2. Maximum of every window of size K in an array
  • Ans. 

    Find maximum of every window of size K in an array

    • Iterate through the array and maintain a deque of indices of elements in the current window

    • Remove indices from the front of the deque if they are outside the current window

    • Remove indices from the back of the deque if their corresponding elements are smaller than the current element

    • The front of the deque will always contain the index of the maximum element in the current

  • Answered by AI
  • Q3. Binary Search in a semi infinite array
  • Ans. 

    Implement binary search in a semi-infinite array.

    • Start with the first element and keep doubling the index until the target element is less than the current element.

    • Perform binary search on the subarray from the last doubled index to the current index.

    • If the target element is not found, repeat the process by doubling the last index and searching again.

    • Handle edge cases where the target element is at the first index or n

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Some MCQs on Networking,OS,etc. were asked and 3 coding questions on linked list,etc. were asked.
Tips: Be fast and confident.
Duration: 1 hour 30 minutes
Total Questions: 32

Round: Technical Interview
Experience: Interviewer asked my name and interests and then went about with the questions.
Tips: Must be strong in algorithms and data structures.

Round: Technical Interview
Experience: I was initially unable to solve it but I asked for some hints which were enough.
Tips: Take your time and ask for hints if required.

College Name: IIT Varanasi

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The selection procedure consisted of one online round followed by 4 face to face interviews.
1st round consisted of 20 MCQs of C/C++ and general aptitude. They shortlisted only 11 B.Techs after first round. Then we had 4 separate interviews out of which one was Bar Raiser round (which is most important).

Round: Technical Interview
Experience: Each interview was of around an hour. They mainly emphasized on data structure part. I got a lot of questions from tree and linked list and few were based on Operating System's concepts. For most of the questions, they asked me to come up with more than one approach and also they introduced many variations in between. After the discussion of approach, I was supposed to write the complete code on paper.Each round was kind of elimination round and the Bar Raiser round was most important of all.

General Tips: For improving coding skills, first code basic searching, sorting and graph algorithms.Then try to program few random questions of trees and linked list while studying there concepts. Then practice some questions from sites like codechef or codeforces and also try to participate in the competitions that take place on these sites.For Operating Systems, just go through the book written by "S Galvin" and try to clear concepts of memory management part.
Apart from these main topics, just have a glance at these few topics:
Database : Basic Queries, Indexing, Transaction
OOP : Definition with understanding of four features of OOPs.Among non-technical stuffs, practice some famous puzzles (just Google it).
After all these done, just keep on solving interviews questions being updated regularly at geeksforgeeks
Overall Experience was very good and challenging as it was the very first day of placement and our interviews went till 4 in the morning. So when the result came, we were very excited.
Skills:
College Name: NIT Surathkal

I was interviewed before Jan 2016.

Interview Preparation Tips

Round: Test
Duration: 1 hour 30 minutes
Total Questions: 22

College Name: Manipal University Jaipur

I was interviewed in Dec 2016.

Interview Questionnaire 

2 Questions

  • Q1. Convert expression to post-fix
  • Ans. 

    Convert an expression to post-fix notation.

    • Start with an empty stack.

    • Scan the expression from left to right.

    • If the scanned character is an operand, output it.

    • If the scanned character is an operator, pop two operands from stack, output them in post-fix notation and push the result back.

    • Repeat until the end of expression.

  • Answered by AI
  • Q2. Maximum continous sum in an array of integers
  • Ans. 

    Find the maximum continuous sum in an array of integers.

    • Use Kadane's algorithm to find the maximum subarray sum in linear time complexity.

    • Initialize two variables, one for current maximum sum and another for overall maximum sum.

    • Iterate through the array and update the variables accordingly.

    • Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum continuous sum is 6 (from index 3 to 6).

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: I interned at Amazon, which allowed me to skip round 1.
Tips: Just go through questions on geeksforgeeks and practice on hackerrank, almost all of the questions will come from them.

Round: Technical Interview
Experience: The discussion was mainly focused on my interests and what all I had learned from my previous experiences.
Tips: You should show your passion for the technology here. What fascinates you the most in tech. Are you a curious one. Don't try to fake here as it might backfire.

Round: Technical Interview
Experience: 2 programming questions.
Tips: If you have give a sincere effort in practicing to solve algorithmic problems you should be good.

Round: HR Interview
Experience: I had gone through this code on geeksforgeeks, so I had a basic idea of the approach and hence I was able to solve it. This round was taken by the manager and we mostly discussed my interests.
Tips: A genuine interest in any particular field will be of great help.

College Name: IIT

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Google Interview FAQs

How many rounds are there in Google SDE (Software Development Engineer) interview?
Google interview process usually has 2 rounds. The most common rounds in the Google interview process are One-on-one Round, Resume Shortlist and HR.
What are the top questions asked in Google SDE (Software Development Engineer) interview?

Some of the top questions asked at the Google SDE (Software Development Engineer) interview -

  1. Design the algorithm with less time complex...read more
  2. merge sort and heap sort descr...read more
  3. Time complexity of the program wriit...read more

Recently Viewed

INTERVIEWS

Oracle

No Interviews

INTERVIEWS

Zoho

No Interviews

INTERVIEWS

Ola Cabs

No Interviews

INTERVIEWS

Amazon

No Interviews

INTERVIEWS

Amazon

No Interviews

INTERVIEWS

SAP

No Interviews

INTERVIEWS

Samsung

No Interviews

INTERVIEWS

Fractal Analytics

No Interviews

INTERVIEWS

Amazon

No Interviews

INTERVIEWS

Hike

No Interviews

Tell us how to improve this page.

Google SDE (Software Development Engineer) Salary
based on 200 salaries
₹36.4 L/yr - ₹100 L/yr
140% more than the average SDE (Software Development Engineer) Salary in India
View more details

Google SDE (Software Development Engineer) Reviews and Ratings

based on 15 reviews

4.7/5

Rating in categories

4.6

Skill development

4.5

Work-life balance

4.5

Salary

4.3

Job security

4.5

Company culture

4.4

Promotions

4.5

Work satisfaction

Explore 15 Reviews and Ratings
Software Engineer
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
680 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Scientist
274 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sde1
257 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Google with

Yahoo

4.6
Compare

Amazon

4.1
Compare

Facebook

4.3
Compare

Microsoft Corporation

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent