Faster and better experience!
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Leetcode hard questions asked in the interview
Object oriented programming and databases
I applied via Company Website and was interviewed before Apr 2023. There were 4 interview rounds.
Good often good in aptitude
Code test are hard and not easy to crack
What people are saying about Google
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Basic code and dbms query
A constructor is a special type of method that is automatically called when an object is created.
Constructors have the same name as the class they belong to
They are used to initialize the object's state
Constructors do not have a return type
They can be overloaded to accept different parameters
posted on 8 Mar 2025
I appeared for an interview in Feb 2025.
There are two rounds in the interview process: the first round consists of one data structures and algorithms question based on trees.
Binary Search Trees (BST) enable efficient data storage and retrieval through a hierarchical structure, optimizing search operations.
A BST is a binary tree where each node has at most two children.
For any given node, all values in the left subtree are less, and all values in the right subtree are greater.
Searching for a value in a BST has an average time complexity of O(log n).
Insertion and deletion operations also mai...
Aptitude and coding question were asked
posted on 1 Sep 2024
6 questions asked in an interview
The slider window problem involves finding the maximum sum of a subarray of a fixed size k within an array of integers.
Use a sliding window approach to efficiently find the maximum sum subarray.
Keep track of the current sum within the window and update it as you slide the window.
Maintain a variable to store the maximum sum found so far.
Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and window size k=3, the maximum sum
The stock buy sell problem involves finding the maximum profit that can be made by buying and selling a stock at the right times.
Calculate the difference between each pair of consecutive prices in the array
Find the maximum subarray sum of the differences using Kadane's algorithm
The maximum subarray sum is the maximum profit that can be made
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
General aptitude and out put realted questions
Face to face dsa and string manipulations
I applied via Recruitment Consulltant and was interviewed before Jul 2022. There were 4 interview rounds.
Java oops ds algo framework design api sql must
Coding ds framework design sql
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
Core java and OOPS concepts and basic coding tricks and puzzly questions
based on 5 interviews
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
1.8k
salaries
| ₹19 L/yr - ₹80 L/yr |
Software Developer
1.5k
salaries
| ₹27.2 L/yr - ₹60 L/yr |
Senior Software Engineer
860
salaries
| ₹20 L/yr - ₹80 L/yr |
Data Scientist
300
salaries
| ₹26 L/yr - ₹55 L/yr |
Data Analyst
261
salaries
| ₹7.2 L/yr - ₹22.8 L/yr |
Yahoo
Amazon
Microsoft Corporation