i
ACKO
Filter interviews by
Clear (1)
I was interviewed 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 was interviewed 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
posted on 5 Dec 2024
All aptitude type questions as well as core computer science subject questions comes
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.
I was interviewed in Jan 2025.
Basic aptitude questions to
Basic coding questions
posted on 13 Dec 2024
Profit loss , number system, code decode
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...
posted on 8 Feb 2024
.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...
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 ...
posted on 25 Jul 2024
based on 1 interview
Interview experience
based on 9 reviews
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