i
ACKO
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
Top trending discussions
posted on 5 Dec 2024
All aptitude type questions as well as core computer science subject questions comes
posted on 25 May 2024
I was interviewed in Jul 2021.
Round duration - 60 minutes
Round difficulty - Easy
Easy level DSA questions were asked to implement.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure the traversal starts from vertex 0 and follows the BFS order.
Output the BFS traversal sequence for each test case in a separate line.
Handle disconnected components by checking for unvisited nodes.
Consider t...
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Round duration - 60 minutes
Round difficulty - Easy
DSA questions based on trees were asked to implement.
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.
Use a queue to perform level order traversal of the binary tree.
Store the leftmost node at each level in the result array.
Return the result array containing the left view of the binary
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Perform level order traversal of the binary tree.
For each level, add the rightmost node to the result.
Print the result as the right view of the binary tree.
Handle null nodes represented by -1 in the input.
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.
The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.
Consider edge cases like a single node tree or empty tree while calculating the height.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round where the interviewer asked questions to know more about me.
Tip 1 : Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.
Experienced Senior Executive with a proven track record in leading teams and driving business growth.
Over 10 years of experience in senior leadership roles
Strong strategic planning and decision-making skills
Successful track record in increasing revenue and profitability
Effective communicator and team leader
Led a team that achieved a 20% increase in sales last year
I led a team of professionals in developing and implementing strategic initiatives to drive company growth.
Led a team in developing and implementing strategic initiatives
Focused on driving company growth
Collaborated with cross-functional teams to achieve goals
I was interviewed in Jan 2025.
Basic aptitude questions to
Basic coding questions
I was interviewed before Jan 2024.
I was interviewed before Jan 2024.
General questions about the basics of insurance.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Assistant Manager
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Service Executive
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Claims Specialist
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
29
salaries
| ₹0 L/yr - ₹0 L/yr |
PolicyBazaar
Digit Insurance
ICICI Lombard General Insurance Company
Bajaj Allianz General Insurance