Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Approached by Company and was interviewed in Oct 2021. There were 2 interview rounds.
A piece of paper was given to me and I need to tell the some basics of computer languages
How can I lead my team
Calculate the number of children and grandchildren
Count the number of direct children of a person
Count the number of grandchildren of a person
Use recursion to count all descendants
Consider only living descendants
Exclude step-children and adopted children
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
Partition even and odd numbers in an array
Iterate through the array and check if each number is even or odd
Create two separate arrays for even and odd numbers
Combine the two arrays to get the final partitioned array
Find leaders in an array of strings
Leaders are elements that are greater than all elements to their right
Traverse array from right to left and keep track of maximum element
Add maximum element to result if it is a leader
I applied via Company Website and was interviewed in Mar 2021. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2021. There was 1 interview round.
I appeared for an interview before Dec 2020.
Round duration - 120 minutes
Round difficulty - Medium
Timing was in the afternoon.
The platform was easy to operate and worked on considerable speed.
Both the webcam and audio was supposed to be ON during the test duration.
We could switch between the questions of the same section in case we wanted to change the answers.
You are provided with an undirected, connected, and weighted graph G(V, E). The graph comprises V vertices (numbered from 0 to V-1) and E edges.
Determine and retu...
Find the total weight of the Minimum Spanning Tree in a graph using Kruskal's algorithm.
Implement Kruskal's algorithm to find the Minimum Spanning Tree.
Sort the edges based on their weights and add them to the MST if they don't form a cycle.
Keep track of the total weight of the MST and return it as the output.
You are provided with a 2-D plane and a set of integer coordinates. Your task is to determine the maximum number of these coordinates that can be aligned ...
Find the maximum number of points that can be aligned in a straight line on a 2-D plane.
Iterate through each pair of points and calculate the slope between them.
Store the slope in a hashmap and keep track of the frequency of each slope.
The maximum frequency of slopes + 1 gives the maximum number of points on a straight line.
Tip 1 : You should be very fluent in each and every data structure that you have studied so that you are able to answer even the trickiest question by knowing the basics. This will happen only if you have tried enough questions on different platforms.
Tip 2 : Object Oriented Programming is the easiest and the most underrated concept. In every interview I have given so far, they have asked me the OOPs concepts. I have learnt and understood each and every basic concept of OOPs, primarily from the videos of Coding Ninjas which have polished my skill in this area and now I can answer any question of this topic.
Tip 3 : The projects that you have done in your college life should be on your tips. You should know each and every little detail of it, and sometimes the interviewer may also ask what would happen if you changed some things in your project, so you should be clear with it's working and how would your project work after changing some specifications.
Tip 1 : Highlight your technical skills and write only the things from which you will be comfortable answering from.
Tip 2 : Try to maximize the number of technical achievements on the resume and minimize the extra curricular part.
I applied via LinkedIn and was interviewed in Jun 2021. There were 3 interview rounds.
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.
Use dynamic programming to keep track of the longest increasing subsequence length for each element.
Return the maximum length found as the result.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Various SQL queries related to data manipulation and retrieval were asked during the interview.
Basic SELECT queries to retrieve data from a single table
JOIN queries to retrieve data from multiple tables based on a common column
Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data
Subqueries to retrieve data based on the result of another query
UPDATE queries to modify existing data in a table
DELE...
Round duration - 60 Minutes
Round difficulty - Medium
Given a string STR
of size N
and an integer M
representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...
Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.
Iterate through the string and distribute characters to rows based on zig-zag pattern
Concatenate the characters in each row to get the final result
Handle edge cases like when number of rows is 1 or equal to the length of the string
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if the string is empty or has only one character, return the string
Example: Input: 'aaabcc', Output: 'abc'
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
The first and only line of input ...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters in the input string by using a set to store unique permutations.
Round duration - 60 Minutes
Round difficulty - Medium
Design an e-commerce website similar to Flipkart or Amazon.
Implement user-friendly interface for easy navigation
Include search functionality with filters for products
Incorporate secure payment gateway for transactions
Provide personalized recommendations based on user behavior
Include customer reviews and ratings for products
Implement order tracking and delivery status updates
Offer various payment options like credit/deb
Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.
Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
Program to reverse a string in minimum iteration
Use two pointers, one at the start and one at the end of the string
Swap the characters at the two pointers and move the pointers towards each other
Repeat until the pointers meet in the middle of the string
based on 3 interviews
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
1.8k
salaries
| ₹19 L/yr - ₹80 L/yr |
Software Developer
1.5k
salaries
| ₹26 L/yr - ₹60 L/yr |
Senior Software Engineer
850
salaries
| ₹20.1 L/yr - ₹85 L/yr |
Data Scientist
300
salaries
| ₹25.7 L/yr - ₹57.5 L/yr |
Data Analyst
261
salaries
| ₹7.2 L/yr - ₹22.8 L/yr |
Yahoo
Amazon
Microsoft Corporation