i
ACKO
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
4 coding problems + 1 sql problem
Given a binary tree, return the inorder traversal of its nodes' values.
Inorder traversal: left subtree, root, right subtree
Use recursion to traverse the tree
Implement a stack-based iterative solution for better space complexity
I appeared for an interview 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 appeared for an interview 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
I appeared for an interview 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.
ACKO interview questions for designations
Top trending discussions
I appeared for an interview before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
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 appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
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 in a 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 to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
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 appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview Round with questions based on Data structures, OOPS and SQL.
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 edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
SQL query to find the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries
Combine the above steps in a single query to find the nth highest salary
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include encapsulation, inheritance, and polymorphism.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Inheritance allows classes to inherit at...
Round duration - 60 minutes
Round difficulty - Easy
Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site like the one satyam has.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are overridden in derived classes using the 'override' keyword.
They allow a function to be called based on the runtime type of an object.
Virtual functions enable dynamic binding and late binding in C++.
Example: virtual void ...
Design a Cinema Ticket Reservation System
Use a database to store movie information, showtimes, and seat availability
Allow users to search for movies, select showtimes, and choose seats
Implement a payment system for ticket purchases
Send confirmation emails with QR codes for ticket validation
You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.
Divide the 10 balls into two groups of 5 each.
Weigh the two groups on the balance scale.
If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.
Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.
Weigh the two groups on the bala...
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
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 Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Find subset of numbers in array that sum up to zero.
Use a nested loop to iterate through all possible subsets.
Calculate the sum of each subset and check if it equals zero.
Store the subset if the sum is zero.
Optimize the solution by using a hash set to store the cumulative sum of elements.
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.
BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.
It uses a queue data structure to keep track of the vertices to be visited.
BFS guarantees that it visits all the vertices of a connected graph.
It can be used to find the shortest path between two
In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.
Continuously improving my technical skills through learning and hands-on experience
Taking on leadership roles and mentoring junior developers
Contributing to the development of cutting-edge software solutions
Building strong relationships with clients and stakeholders
Staying updated with the latest indu...
I appeared for an interview before Jan 2021.
Round duration - 75 minutes
Round difficulty - Easy
Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked.
Tips: Time management is important. Remember all the syntaxes
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the input string length and number of test cases.
Round duration - 60 minutes
Round difficulty - Easy
It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it
Given two strings, A
and B
, determine whether A
can be transformed into B
by performing at most one of the following operations (including zero operations):
1. Delete a ch...
Determine if one string can be transformed into another by performing at most one operation (insert, delete, replace).
Iterate through both strings simultaneously and check for differences.
Handle cases where a character needs to be inserted, deleted, or replaced.
Keep track of the number of operations performed and ensure it does not exceed one.
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Remove duplicate occurrences of characters in a given string.
Use a hash set to keep track of characters seen so far.
Iterate through the string and add non-duplicate characters to a new string.
Return the new string without duplicate characters.
Round duration - 30 minutes
Round difficulty - Easy
It was easy. I could answer the first question. Second one I answered really badly
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Revise C++/Java.
Tip 3 : If you don't know much of C++/Java at least write the codes in C.
Tip 4 : Go through all the previous interview experiences from Codestudio and Leetcode.
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 appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on DSA and OOPS concepts.
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weights.
Handle disc...
C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.
C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.
C does not support classes and objects, while C++ does.
C does not have features like inheritance and polymorphism, which are present in C++.
C is a subset of C++, m...
malloc is a function in C for dynamic memory allocation, while new is an operator in C++ for dynamic memory allocation and object creation.
malloc is a function in C, while new is an operator in C++.
malloc returns a void pointer, while new returns a pointer to the type being allocated.
malloc does not call constructors, while new calls constructors for object initialization.
malloc requires manual memory deallocation with...
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in C++
They are used in inheritance to achieve runtime polymorphism
Example: virtual void display() = 0; in a base class and void display() override in a derived class
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on SQL and OOPS concepts.
Query to find the nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to select the nth highest salary
Consider handling cases where there may be ties for the nth highest salary
Stack is used for static memory allocation and stores local variables, while Heap is used for dynamic memory allocation and stores objects.
Stack is faster than Heap as it has a fixed size and memory allocation is done at compile time.
Heap is slower than Stack as memory allocation is done at runtime and requires more complex management.
Stack memory is limited and typically smaller in size, while Heap memory is larger an...
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for around 30 minutes. The interviewer asked questions to know more about me. We also discussed a puzzle.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
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.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Assistant Manager
86
salaries
| ₹4 L/yr - ₹11 L/yr |
Product Designer
80
salaries
| ₹10 L/yr - ₹28 L/yr |
Customer Service Executive
50
salaries
| ₹2.8 L/yr - ₹4.6 L/yr |
Claims Specialist
46
salaries
| ₹4 L/yr - ₹7 L/yr |
Senior Manager
45
salaries
| ₹10.5 L/yr - ₹35 L/yr |
Fiserv
PhonePe
KFintech
Angel One