i
ACKO
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed before Jun 2023.
Design a parking lot system with multiple levels and spots for cars.
Create a class for ParkingLot with attributes like levels, spots per level, etc.
Implement methods for parking a car, removing a car, checking availability, etc.
Consider implementing a ticketing system for tracking parked cars.
Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.
Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.
Break the large file into smaller chunks that can fit into memory
Sort each chunk individually using a sorting algorithm like merge sort
Merge the sorted chunks back together to get the final sorted result
I was interviewed in May 2022.
Round duration - 75 Minutes
Round difficulty - Medium
The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
Perform a depth-first search (DFS) on both trees simultaneously
At each node, check if the values are equal and the left and right subtrees are either both null or both not null
If the above conditions are met, recursively check the flip equivalence of the left and right subtrees
If any of the condition...
You are provided with an integer array ARR
of size N
sorted in ascending order. Your task is to determine if it is possible to split this array i...
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
Check if the array can be split into increasing subsequences by iterating through the array.
Keep track of the current subsequence and its length while iterating.
If the difference between the current element and the previous element is not 1, start a new subsequence.
If the length of any subseque...
Round duration - 60 Minutes
Round difficulty - Easy
The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
The task is to rearrange the given array such that every second element is greater than its left and right element.
Iterate through the array and check if every second element is greater than its left and right element
If not, swap the current element with its adjacent element to satisfy the condition
Continue this process until the entire array satisfies the condition
Return 1 if the array satisfies the condition, else re
Round duration - 30 Minutes
Round difficulty - Easy
10:30 PM
Interviewer was Cool.
Round duration - 5 minutes
Round difficulty - Easy
At 10:00 am
Tip 1 : Never never try to cheat in online interview the interviewer will definitely get to know.
Tip 2 : Psuedo code presentation matters a lot so name Your variable properly and with proper indentation.
Tip 3 : Keep on trying even if You feel that's not the right answer so at least put that idea forward.
Tip 4 : Do Leetcode medium questions as much as possible As they are mostly asked in Interviews.
Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page
Top trending discussions
Write code for advance surrying in js
Implement custom hook for api call
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
I applied via Campus Placement
One medium and one standard DP question
Design Google Pay - a digital wallet platform for online payments and transactions.
Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.
Enable users to make payments in stores, online, and within apps using their stored payment methods.
Implement security features like biometric authentication, tokenization, and encryption to protect user data.
Provide features fo...
High Level Design (HLD) of recursive functions in software development.
Recursive functions call themselves to solve smaller instances of the same problem.
HLD of recursive functions involves defining the base case, recursive case, and termination condition.
Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Data Structures Algorithms
Data Structures and Algorithm
Medium Leetcode, Array, String, Tree, DP
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Assistant Manager
83
salaries
| ₹5 L/yr - ₹12.6 L/yr |
Customer Service Executive
50
salaries
| ₹2.8 L/yr - ₹4.6 L/yr |
Claims Specialist
47
salaries
| ₹4 L/yr - ₹6.8 L/yr |
Senior Associate
40
salaries
| ₹3 L/yr - ₹6.1 L/yr |
Team Lead
29
salaries
| ₹4.1 L/yr - ₹9.7 L/yr |
PolicyBazaar
Digit Insurance
ICICI Lombard General Insurance Company
Bajaj Allianz General Insurance