Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Approached by Company and was interviewed in Sep 2023. There was 1 interview round.
Asked bread first search
Print a level and find a number in binary tree with a -> a/a+a , a+a/a
Find the number of combinations to achieve a target with given coins of denomination 2 and 5
Use dynamic programming approach
Create a table to store the number of combinations for each target value
Base cases: 0 can be achieved in 1 way, all negative values can be achieved in 0 ways
For each coin, update the table with the number of combinations for each target value
Find the maximum value by jumping to any number and multiplying jump length by value at the location.
Iterate through the array and calculate the maximum value for each possible jump
Keep track of the maximum value found so far
Return the maximum value
I applied via Walk-in and was interviewed before Feb 2023. There were 2 interview rounds.
What people are saying about Google
I applied via Approached by Company and was interviewed in Dec 2022. There were 2 interview rounds.
Topological sort is used to order a directed graph's nodes in a way that all edges go from earlier to later nodes.
Create a graph data structure to represent the dependencies between operations.
Use a depth-first search algorithm to perform the topological sort.
Start by selecting a node with no incoming edges as the first operation to be performed.
Remove this node and its outgoing edges from the graph, then repeat the pr...
Transliteration logic converts text from one script to another, typically preserving pronunciation.
Transliteration is not the same as translation, it focuses on converting characters from one script to another.
Commonly used for European languages like Greek, Cyrillic, and Latin scripts.
Transliteration rules vary by language, for example, converting Cyrillic 'ш' to Latin 'sh'.
Google interview questions for designations
I applied via Approached by Company and was interviewed before Jul 2022. There were 3 interview rounds.
Write a program to solve a challenging programming and algorithm problem.
Program to find the maximum subarray sum using Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here with the maximum of current element or current element + max_ending_here
Update max_so_far with the maximum of max_so_far and max_ending_here
Implement a program to find the longest common subsequence of two strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Trace back the array to reconstruct the longest common subsequence.
Get interview-ready with Top Google Interview Questions
I applied via Approached by Company and was interviewed before Mar 2022. There were 2 interview rounds.
Using a robot to sort boxes by their ID in ascending order.
Create a list of boxes with their IDs
Program the robot to pick up boxes based on their ID
Use a sorting algorithm to sort the list of boxes by ID
Program the robot to move the boxes in the sorted order
Find length of largest arithmetic sequence in binary tree.
Traverse the tree and for each node, calculate the length of the longest arithmetic sequence that includes that node.
Use dynamic programming to store the length of the longest arithmetic sequence for each node.
The length of the longest arithmetic sequence for a node is the maximum of the lengths of the longest arithmetic sequences for its left and right children...
Some of the top questions asked at the Google Senior Software Engineer interview -
2 Interview rounds
based on 19 reviews
Rating in categories
Software Engineer
1.3k
salaries
| ₹20 L/yr - ₹80 L/yr |
Software Developer
772
salaries
| ₹30.7 L/yr - ₹70 L/yr |
Senior Software Engineer
588
salaries
| ₹22 L/yr - ₹94 L/yr |
Sde1
252
salaries
| ₹16 L/yr - ₹64 L/yr |
Data Scientist
232
salaries
| ₹12 L/yr - ₹50 L/yr |
Yahoo
Amazon
Microsoft Corporation