i
ACKO
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Aug 2022. There were 2 interview rounds.
Insurance is a financial product that provides protection against financial losses.
Insurance is a contract between an individual or organization and an insurance company, where the individual or organization pays a premium in exchange for coverage against specified risks.
Types of insurance include health insurance, life insurance, auto insurance, home insurance, and more.
Insurance policies outline the terms and conditi...
I applied via Internshala and was interviewed before Mar 2022. There were 3 interview rounds.
Yes
Conduct regular employee surveys to gather feedback and identify areas for improvement
Implement a recognition and rewards program to acknowledge and appreciate employee contributions
Provide opportunities for professional development and growth through training programs and workshops
Promote open communication and transparency within the organization
Organize team-building activities and events to foster a sense of cam...
I am proficient in using various designing tools such as Adobe Photoshop, Illustrator, and Sketch.
Proficient in Adobe Photoshop, Illustrator, and Sketch
Experience in creating visually appealing designs
Knowledge of design principles and best practices
Ability to work with different file formats and export options
Intranet is a private network for internal communication within an organization, while a website is a public platform accessible to anyone with an internet connection.
Intranet is accessible only within an organization, while a website is accessible to anyone with an internet connection.
Intranet is used for internal communication, sharing of information and resources within an organization, while a website is used for p...
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Easy
The online round had 2 coding questions and one question of a regular expression.
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Find all pairs of elements in an array that add up to a given target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair (e.g., target = 6, array = [3, 3]).
Given a sequence ARR
consisting of N
integers, your task is to identify the longest subsegment of ARR
, where you can change at most one number to make the subsegmen...
Find the longest subsegment where at most one number can be changed to make it strictly increasing.
Iterate through the array and keep track of the longest increasing subsegment with at most one change.
If a number violates the increasing order, try changing it and check if the subsegment becomes strictly increasing.
Update the length of the longest subsegment found so far.
Return the length of the longest subsegment for e
Round duration - 60 minutes
Round difficulty - Easy
First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them. He asked questions related to Node Js, React Js, Mongo DB, AWS as all these were mentioned in my Resume. Around 25 minutes was completed explaining each and everything.
Then he started with the coding questions. I was allowed to share my screen and use any of my favourite text editors. I chose ‘VS Code’.
I was able to solve 2 coding questions very easily. I got stuck in the puzzle as I didn’t solve any puzzles before. I was able to come up with different approaches, but they weren’t the most optimal. He tried giving me a lot of hints but still wasn’t able to solve it. I had a positive can-do attitude throughout, and I was really close to solving it.
Feedback: He told me I performed well and asked if I had any questions for him. I asked for the solution to the puzzle. He explained to me the solution and I told him that I will practice puzzles.
Around 5-6 students got selected for 2nd Interview.
You are provided an array ARR
of integers. Your task is to rearrange this array such that all elements with zero values are moved to the left, and all non-zero elements follow them, pre...
Rearrange array with zeros on the left and non-zeros on the right while maintaining original order.
Iterate through the array from right to left, moving non-zero elements to the end of the array.
Track the index where non-zero elements should be placed.
Fill the beginning of the array with zeros and the rest with non-zero elements in their original order.
Given an array of integers and a number K
, your task is to form pairs of elements from the array such that the absolute difference between them is st...
Find maximum sum of disjoint pairs with specific difference in an array.
Sort the array in non-decreasing order.
Iterate through the array and form pairs with absolute difference less than K.
Keep track of the sum of disjoint pairs to maximize it.
Return the maximum sum obtained.
Round duration - 35 minutes
Round difficulty - Medium
It started with a brief Introduction and in-depth discussions on projects. He also asked me a lot of questions about my previous internship. He asked me some behavioural questions as well.
I was able to solve the question, and he did not ask me any other questions. This round was really short for me and was finished in around 35 minutes, well before time. I asked about my feedback, and he told me that the ‘HR’ will get back to me. I thought he was not satisfied with my answers and I will be rejected though I gave very good answers to every question.
3 students got selected for the next round. I think he was satisfied and did not want to waste more time asking questions.
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general...
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
Iterate through the coefficients and degrees arrays to combine like terms
Create a new array to store the simplified polynomial in descending order of degrees
Return the simplified polynomial array
Round duration - 60 minutes
Round difficulty - Medium
It started with an introduction and discussion on projects. He seemed very curious about my project and went ahead to cross-question every functionality. We discussed everything and how the code works. He asked me a lot of questions on ‘Socket’ as my project mentioned it.
HR-related questions such as:
Why do you want to join the company?
Where do you see yourself in the next 5 years?
What are your strengths and weakness?
Tip 1 : Must know the standard algorithms (eg: searching, sorting)
Tip 2 : Practise mock interviews with your friends
Tip 1 : Project with the deployed link and Github link
Tip 2 : Don't put information which is not relevant to the job profile
I was interviewed in Dec 2020.
Round duration - 50 minutes
Round difficulty - Easy
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and move all zero elements to the left side of the array while maintaining the relative order of non-zero elements.
Use two pointers approach to swap elements efficiently.
Ensure to solve the problem in linear time and constant space complexity.
Ex...
Given a maze of size N * N
with a rat placed at the top-left corner, find and print all possible paths that the rat can take to reach the bottom-right corner. The rat can m...
Find and print all possible paths for a rat to reach the bottom-right corner of a maze.
Create a recursive function to explore all possible paths in the maze.
Keep track of the current path and mark visited cells.
Return the paths as matrices with 1 for cells in the path and 0 for others.
Round duration - 60 minutes
Round difficulty - Medium
First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them.
You are provided with a chain of matrices A1, A2, A3, ..., An. The goal is to determine the minimum number of scalar multiplications needed to multiply these ...
The goal is to determine the minimum number of scalar multiplications needed to multiply a chain of matrices together.
Understand the matrix chain multiplication problem statement and how the dimensions of matrices are defined by the input array.
Implement a dynamic programming approach to find the minimum cost of matrix multiplication.
Consider the constraints provided and optimize the solution accordingly.
Test the solut...
Designing an application like Instagram involves creating a platform for sharing photos and videos with social networking features.
Implement user profiles with the ability to upload, like, comment, and share photos/videos
Develop a news feed algorithm to display content based on user preferences and interactions
Include features like filters, hashtags, geotagging, and direct messaging
Integrate push notifications for like...
Round duration - 20 minutes
Round difficulty - Easy
Tip 1 : Good understanding OOPS
Tip 2 : Practice standard Ds and Algo questions
Tip 3 : Be confident
Tip 1 : Resume should be one page.
Tip 2 : Don't mention those things your not confident of
ACKO interview questions for popular designations
I was interviewed before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle cases where the position is at the beginning or end of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
Round duration - 120 minutes
Round difficulty - Easy
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The problem involves finding the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Use recursion to calculate the diameter of the binary tree.
Keep track of the maximum diameter found during traversal.
Consider the height of the left and right subtrees to calculate the diameter.
Example: For the input 1 2 3 ...
Tip 1 : Have good projects
Tip 2 : Have good internships
Tip 3 : Clear all basic
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Get interview-ready with Top ACKO Interview Questions
I applied via Recruitment Consulltant and was interviewed before Dec 2021. There were 2 interview rounds.
I applied via Walk-in and was interviewed in Aug 2019. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed before Apr 2020. There were 4 interview rounds.
Top trending discussions
Some of the top questions asked at the ACKO interview -
The duration of ACKO interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 66 interviews
Interview experience
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