i
ACKO
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I appeared for an interview 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
I appeared for an interview 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
Top trending discussions
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
test timing: 7-8 pm
2 programming questions
webcam proctored
You are provided with an array ARR
of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...
Find minimum cost to reach end of array by jumping with constraints
Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
Convert the string to lowercase and remove all symbols and whitespaces.
Reverse the modified string and compare it with the original string.
If they are equal, then the string is a palindrome.
If not, then the string is not a palindrome.
Given a number N
, calculate its square root and output the integer part only.
18
4
The square root of 18 is approximate...
The task is to find the integral part of the square root of a given number.
Use the built-in square root function to find the square root of the number.
Convert the result to an integer by rounding down or using the floor function.
Print the integer part of the square root as the output.
Given a positive integer N
, your task is to determine the minimum number of steps required to reduce N
to 1.
1) Subtract 1 from it: n = n -...
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
Use dynamic programming to solve the problem efficiently.
Create an array to store the minimum steps required for each number from 1 to N.
Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.
Return the minimum steps for N.
Round duration - 60 Minutes
Round difficulty - Medium
They started Fundamentals of OOP- Inheritance, Polymorphism
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
Initialize two variables, maxSum and currentSum, both set to the first element of the array.
Iterate through the array from the second element.
For each element, update currentSum by adding the element to it.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
After iterating ...
Round duration - 30 Minutes
Round difficulty - Medium
Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom
Tip 1 : Solve atleast 200 problems
Tip 2 : Focus on all data structures
Tip 3 : Build some good projects
Tip 1 : Keep it precise and concise.
Tip 2 : Build your resume yourself according your skills
I applied via Naukri.com and was interviewed in Feb 2020. There was 1 interview round.
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...
Object Oriented Programming is a programming paradigm that uses objects to represent real-world entities.
Encapsulation: bundling data and methods that operate on that data within one unit
Inheritance: creating new classes from existing ones, inheriting their properties and methods
Polymorphism: ability of objects to take on multiple forms or behaviors
Abstraction: hiding complex implementation details and providing a simp...
Abstraction is hiding implementation details while polymorphism is using a single interface for multiple types.
Abstraction: Encapsulation, Interfaces, Abstract classes
Polymorphism: Method Overloading, Method Overriding, Interfaces
Abstraction Example: Car - we don't need to know how the engine works to drive it
Polymorphism Example: Animal - different animals have different sounds but they all have a 'makeSound' method
PayPal is an online payment system that allows individuals and businesses to transfer funds electronically.
Allows users to make payments and money transfers online
Offers a secure and convenient way to pay for goods and services
Provides a platform for businesses to accept payments online
Offers buyer and seller protection for eligible transactions
Can be used to send and receive money internationally
I am excited to join PayPal because of its innovative culture and impact on the global economy.
PayPal's commitment to innovation aligns with my passion for staying up-to-date with the latest technologies.
I am impressed by PayPal's global reach and impact on the economy, and I want to be a part of that.
I appreciate PayPal's focus on diversity and inclusion, and I believe in the importance of working for a company with s...
I applied via Campus Placement
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
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.
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Assistant Manager
85
salaries
| ₹5 L/yr - ₹12.6 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