Upload Button Icon Add office photos

Google

Compare button icon Compare button icon Compare
4.4

based on 1.8k Reviews

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Google Full Stack Software Developer Interview Questions and Answers

Updated 2 Jul 2024

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Java basic questions.
  • Q2. Rest basics methods like get, post, put, delete etc
  • Q3. Given a directory name, write a program to return a list of all .tst files present in the directory and its sub directories.
  • Ans. 

    Program to return list of .tst files in given directory and subdirectories

    • Use recursion to traverse through all directories and subdirectories

    • Check if each file has .tst extension and add to list if true

    • Use built-in functions like os.listdir() and os.path.splitext() in Python

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

(4 Questions)

  • Q1. Difference between == and equals
  • Ans. 

    The '==' operator is used for comparing values of primitive data types, while the 'equals' method is used for comparing objects in Java.

    • Use '==' to compare primitive data types like int, char, boolean, etc.

    • Use 'equals' method to compare objects like Strings, Lists, etc.

    • Example: int a = 5; int b = 5; if(a == b) { // true }

    • Example: String str1 = 'hello'; String str2 = 'hello'; if(str1.equals(str2)) { // true }

  • Answered by AI
  • Q2. Use case of abstract class and interfaces
  • Ans. 

    Abstract classes are used to provide a common base for multiple classes, while interfaces define a contract for classes to implement.

    • Abstract classes can contain both abstract and concrete methods, while interfaces can only have abstract methods.

    • Abstract classes can have constructors, while interfaces cannot.

    • Interfaces allow for multiple inheritance, while classes can only inherit from one abstract class.

    • Abstract class...

  • Answered by AI
  • Q3. Singleton design pattern. Explain and implement (thread safe)
  • Ans. 

    Singleton design pattern ensures a class has only one instance and provides a global point of access to it.

    • Ensure a private static instance variable in the class.

    • Provide a public static method to access the instance, creating it if necessary.

    • Use synchronized keyword or double-checked locking to make it thread-safe.

  • Answered by AI
  • Q4. Merge sort. Explain and implement.
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.

    • Divide the array into two halves

    • Recursively sort each half

    • Merge the sorted halves back together

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Oracle Full Stack Software Developer interview:
  • Java
  • Spring
  • DSA
  • REST API
  • SOAP

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Questions related to 3GPP charging systems and protocols
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Aug 2023. There were 4 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 tips
Round 2 - Coding Test 

So basically the questions were from strings, arrays, bitwise operators and some mathematical logic based questions. There were 10 questions and they will provide you a laptop and you have to complete all of them in 3 hours (java, c++)
Just be prepared on the above mentioned topics the questions were of easy level if your concept is clear you can crack it easily then there will one more round there they will ask theoretical questions once these both technical rounds are clear you're all set to go for HR round. So this is for 1-2yrs exp guys for freshers they also have to go through aptitude round and question pattern is similar

Round 3 - Technical 

(3 Questions)

  • Q1. Basic oops concepts some tricky ques
  • Q2. Questions from collection framework
  • Q3. Multithreading basic questions
Round 4 - HR 

(1 Question)

  • Q1. Basic hr questions
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Aptitude Test 

Normal Aptitude questions, contains some find the output questions based on C programming. DBMS questions also there.

Round 3 - Technical 

(2 Questions)

  • Q1. Binary Search, C programming Return statement.
  • Q2. About internships.

Interview Preparation Tips

Interview preparation tips for other job seekers - Most people asked Problem solving questions.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Few coding tasks asked like palindrome number
Factorial
Basic concept tests based on DSA
Like prove that set is unordered

Round 2 - One-on-one 

(1 Question)

  • Q1. If a glass is started filling with water by 1ml at 0sec and gets doubled at every successive second, at what second the glass is half full
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
No response
Round 1 - Technical 

(2 Questions)

  • Q1. Questions about Nestjs, React and AI
  • Q2. Singlet pattern of NestJS
  • Ans. 

    Singleton pattern in NestJS ensures a class has only one instance and provides a global point of access to it.

    • Use the @Injectable() decorator to mark a class as a singleton in NestJS.

    • Inject the singleton class into other classes using the constructor.

    • The instance of the singleton class will be shared across the application.

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There was 1 interview round.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Project, Oops Concept, Java , which technology u have used ? Framework
  • Q2. Framework, Explain Long Polling ,
  • Ans. 

    Long polling is a web technique where the client sends a request to the server and the server holds the connection open until new data is available.

    • Long polling is a variation of the traditional polling technique where the client sends a request to the server and the server keeps the connection open until new data is available.

    • It is often used in web applications to simulate real-time updates without the need for const...

  • Answered by AI
  • Q3. GraphQL Vs Rest
  • Ans. 

    GraphQL is a query language for APIs that allows clients to request only the data they need, while REST is an architectural style for designing networked applications.

    • GraphQL allows clients to request specific data in a single request, reducing over-fetching and under-fetching of data.

    • REST uses multiple endpoints for different resources, leading to multiple requests for related data.

    • GraphQL provides a strongly typed sc...

  • Answered by AI

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Hard

  • Q1. Find rank

    You are given a matrix ‘ARR’ having dimensions ‘N*M’. Your task to find the rank of the matrix ‘ARR’.

    The rank of a matrix is defined as:

    (a) The maximum number of linearly independent column ...
  • Ans. Row Echelon Form

    Approach:

    • The idea is based on converting the given input matrix ARR into row echelon form.
    • Since we know that the rank of the matrix can not be greater than min(N, M). So we will check if N > M then we will transpose the input matrix ARR since we are using row echelon form so the matrix has to be transformed in such a way that in each row all the elements to the left of the diagonal element must be ze...
  • Answered by CodingNinjas
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

This is an elimination round. The interviewer will ask some technical questions and ask to solve some coding questions.
The interview was on Microsoft teams and coding was on codility.

  • Q1. Check Permutation

    For a given two strings, 'str1' and 'str2', check whether they are a permutation of each other or not.

    Permutations of each other
    Two strings are said to be a permutatio...
  • Ans. Frequency Array Approach
    • The first and the foremost condition for two strings to be the permutations of each other is that the frequency of each element in both of them should be the same.
    • It can be proven by a very simple argument that we are only rearranging the letters, and not adding or deleting any character.
    • So we allocate an array of size 256 (that is the number of distinct ASCIIacharactersterst to store the freque...
  • Answered by CodingNinjas
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Hard

Interviewers asked some questions regarding System design and then asked me to perform the task

  • Q1. System Design Question

    Design a vending machine.

Round 4 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Hard

There were 2 interviewers. This round was basically Distributed systems.

  • Q1. Ninja And Alternating Largest

    Ninja is given a few numbers, and he is being asked to rearrange the numbers so that every second element is greater than its left and right element.

    Input Format:
    The first...
  • Ans. Brute forceSpace Complexity: O(1)Explanation: Time Complexity: O(n)Explanation:
  • Answered by CodingNinjas
Round 5 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Hard

  • Q1. SQL Questions

    Write an SQL query to print the first three characters of  FIRST_NAME from Worker table.

    Write an SQL query to print the FIRST_NAME from Worker table after replacing ‘a’ with ‘A’.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from HMR Institute of Technology and Management. Eligibility criteriaNo criteriaMicrosoft interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, System Design, Distributed SystemsTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Might ask you to write coding in System Design (Eg : Vending Machine)
Tip 2 : Use star methodology to answer.
Tip 3 : Interact as much as you can with the interviewer and discuss your approach to solve questions.
Tip 4: Start your preparation at least 6 months before application
Tip 5 : Practice Leetcode

Application resume tips for other job seekers

Tip 1 : Resume should match with job description
Tip 2 : Add a summary section and avoid sections like hobbies, strengths 
Tip 3 : Clearly mention your skills

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. Find All Subsets

    You are given an array ‘arr’ of ‘N’ distinct integers. Your task is to find all the non-empty subsets of the array.

    Note: You can return the subsets in any order, you don’t have to speci...

  • Ans. Power Set Using Bit-Masking

     

    One of the standard and useful method of finding the power set is through bit-masking.

    Consider a number with N-bits in its binary representation, if we consider that the state of ith bit depicts whether the ith array element is included in the current subset or not, then we can uniquely identify one of the subsets (as each number has a different binary representation).

    Now we can simply ...

  • Answered by CodingNinjas
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The technical question was mainly based on my resume, followed by coding questions.

  • Q1. Technical Questions

    When do you prefer to use Bokeh and when would you prefer Matplotlib?

    Explain the machine learning project on your resume?
    She gave a situation, and asked what would I implement Supervised...

Round 3 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It was a coding round

  • Q1. Reverse Linked List

    Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

    For example:
    The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...
  • Ans. Brute Force

    The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.

     

    Steps:

    &...

  • Answered by CodingNinjas
Round 4 - HR 

(1 Question)

Round duration - 20 Minutes
Round difficulty - Easy

  • Q1. Basic HR Questions

    What are you hobbies?

    What are your salary expectations?

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from MVJ College of Engineering. I applied for the job as Full Stack Engineer in BengaluruEligibility criteria7 CGPAMicrofocus interview preparation:Topics to prepare for the interview - OOPS, Operating Systems, Data Structures, Database, Machine Learning, AngularTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Maintain a clean resume and have in-depth knowledge of the projects, as in the technical round the interviewer mainly asks technical questions regarding the projects. Questions based on projects are predictable and answering them can give a good impression during the interview.
Tip 2 : Be clear in explaining the approach to coding questions.
Tip 3 : Admit it, if you are not confident in a particular topic. Accepting your weakness is better than a wrong answer.

Application resume tips for other job seekers

Tip 1 : Use formal resume templates and maintain a neat resume.
Tip 2 : Have few development projects on the resume with brief summary of the skills implemented.
Tip 3 : Mention your skills in proper sub-sections.

Final outcome of the interviewSelected

Skills evaluated in this interview

Google Interview FAQs

How many rounds are there in Google Full Stack Software Developer interview?
Google interview process usually has 1 rounds. The most common rounds in the Google interview process are One-on-one Round.

Tell us how to improve this page.

Google Full Stack Software Developer Salary
based on 18 salaries
₹21.4 L/yr - ₹25.4 L/yr
154% more than the average Full Stack Software Developer Salary in India
View more details
Software Engineer
1.3k salaries
unlock blur

₹19.9 L/yr - ₹80 L/yr

Software Developer
826 salaries
unlock blur

₹27.7 L/yr - ₹60 L/yr

Senior Software Engineer
591 salaries
unlock blur

₹23.8 L/yr - ₹85 L/yr

Sde1
252 salaries
unlock blur

₹16 L/yr - ₹64 L/yr

Data Scientist
232 salaries
unlock blur

₹12 L/yr - ₹50 L/yr

Explore more salaries
Compare Google with

Yahoo

4.6
Compare

Amazon

4.1
Compare

Facebook

4.4
Compare

Microsoft Corporation

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview