Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by ACKO Team. If you also belong to the team, you can get access from here

ACKO Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

ACKO Software Developer Interview Questions, Process, and Tips

Updated 3 Jun 2024

Top ACKO Software Developer Interview Questions and Answers

  • Q1. Flip Equivalent Binary Tree Problem Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a f ...read more
  • Q2. Ninja and Alternating Largest Problem Statement Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbo ...read more
  • Q3. Split Array Into Increasing Subsequences Problem Statement You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if i ...read more

ACKO Software Developer Interview Experiences

2 interviews found

I was interviewed in May 2022.

Round 1 - Coding Test 

(2 Questions)

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.

  • Q1. 

    Flip Equivalent Binary Tree Problem

    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...

  • Ans. 

    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...

  • Answered by AI
  • Q2. 

    Split Array Into Increasing Subsequences Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

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.

  • Q1. 

    Ninja and Alternating Largest Problem Statement

    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.

    Example:

    Input:
    ...
  • Ans. 

    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

  • Answered by AI
Round 3 - Video Call 

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round 4 - HR 

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am

Interview Preparation Tips

Eligibility criteriaNo criteria But only 8+ plus CGPA were eventually shortlisted on basis of resumeAcko interview preparation:Topics to prepare for the interview - DSA, DBMS, Puzzles, OS, System DesignTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I was interviewed before Jun 2023.

Round 1 - One-on-one 

(2 Questions)

  • Q1. DSA Round & Introduction Round
  • Q2. DP Question related to subsequence
Round 2 - Technical 

(2 Questions)

  • Q1. Design Parking Lot
  • Ans. 

    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.

  • Answered by AI
  • Q2. Sort Numbers with large file
  • Ans. 

    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

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

All aptitude type questions as well as core computer science subject questions comes

I was interviewed in Jul 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

  • Q1. 

    BFS Traversal in a Graph

    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 ...

  • Ans. 

    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...

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
  • Q3. 

    Nth Fibonacci Number Problem Statement

    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.

    Input:

    ...
  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

  • Q1. 

    Determine the Left View of a Binary Tree

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Right View of Binary Tree

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Height of Binary Tree

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPolicyBazaar.com interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Priority queue code, Fibonacci series, bfs-dfs implementation,tree data structures (like height,left view,right view) basically easy level question of GFG on tree

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Tell me About yourself
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed in Jan 2025.

Round 1 - Aptitude Test 

Basic aptitude questions to

Round 2 - Coding Test 

Basic coding questions

Round 3 - Technical 

(2 Questions)

  • Q1. Thanks tougfh roubd was there
  • Q2. What type of round was conducted during the interview?

Interview Preparation Tips

Interview preparation tips for other job seekers - All the best , thanks for asking
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Profit loss , number system, code decode

Round 2 - Technical 

(1 Question)

  • Q1. What is DDL, DML, DQL
  • Ans. 

    DDL stands for Data Definition Language, DML stands for Data Manipulation Language, and DQL stands for Data Query Language.

    • DDL is used to define the structure of database objects such as tables, indexes, and views.

    • DML is used to manipulate data in the database, such as inserting, updating, and deleting records.

    • DQL is used to retrieve data from the database using queries.

    • Examples: CREATE TABLE is a DDL statement, INSERT...

  • Answered by AI
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(5 Questions)

  • Q1. Oops concept and c# basic questions for freshers and sql basics
  • Q2. What is .net framework
  • Ans. 

    .NET Framework is a software framework developed by Microsoft that provides a runtime environment for building and running applications.

    • .NET Framework is a platform for developing and running applications on Windows.

    • It includes a large library of pre-built code and a runtime environment for executing applications.

    • It supports multiple programming languages such as C#, VB.NET, and F#.

    • It provides features like memory mana...

  • Answered by AI
  • Q3. Stored procesure insert update syntax
  • Q4. Oops questions inheritance constructors
  • Q5. Joins in sql and types
  • Ans. 

    Joins in SQL are used to combine rows from two or more tables based on a related column between them.

    • There are different types of joins in SQL: inner join, left join, right join, and full outer join.

    • Inner join returns only the matching rows from both tables.

    • Left join returns all the rows from the left table and the matching rows from the right table.

    • Right join returns all the rows from the right table and the matching ...

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Basic oops concepts
  • Q2. Web api questions
Contribute & help others!
anonymous
You can choose to be anonymous

ACKO Interview FAQs

How many rounds are there in ACKO Software Developer interview?
ACKO interview process usually has 2 rounds. The most common rounds in the ACKO interview process are One-on-one Round and Technical.
How to prepare for ACKO Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at ACKO. The most common topics and skills that interviewers at ACKO expect are Algorithms, Computer science, Data Structures, Java and Linux.
What are the top questions asked in ACKO Software Developer interview?

Some of the top questions asked at the ACKO Software Developer interview -

  1. Sort Numbers with large f...read more
  2. Design Parking ...read more
  3. DP Question related to subseque...read more

Recently Viewed

INTERVIEWS

Capgemini Engineering

No Interviews

INTERVIEWS

ACKO

No Interviews

INTERVIEWS

Globant

No Interviews

INTERVIEWS

Capgemini Engineering

No Interviews

INTERVIEWS

Steel Strips Wheels

No Interviews

INTERVIEWS

Aspect Ratio

No Interviews

INTERVIEWS

ACKO

No Interviews

INTERVIEWS

Salesforce

No Interviews

INTERVIEWS

Capgemini Engineering

No Interviews

LIST OF COMPANIES

ACKO

Locations

Tell us how to improve this page.

ACKO Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
ACKO Software Developer Salary
based on 16 salaries
₹12 L/yr - ₹25 L/yr
144% more than the average Software Developer Salary in India
View more details

ACKO Software Developer Reviews and Ratings

based on 9 reviews

4.2/5

Rating in categories

3.9

Skill development

4.2

Work-life balance

4.0

Salary

4.1

Job security

4.1

Company culture

3.2

Promotions

3.6

Work satisfaction

Explore 9 Reviews and Ratings
Assistant Manager
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Service Executive
50 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Claims Specialist
47 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
40 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
29 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare ACKO with

PolicyBazaar

3.6
Compare

Digit Insurance

4.0
Compare

ICICI Lombard General Insurance Company

3.7
Compare

Bajaj Allianz General Insurance

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent