Filter interviews by
Clear (1)
I was interviewed in Aug 2021.
Round duration - 45 minutes
Round difficulty - Medium
2 coding questions were given to solve in 45 minutes.
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 in a level order manner and keep track of the leftmost node at each level.
Use a queue to perform level order traversal of the binary tree.
Maintain a count of nodes at each level to identify the leftmost node.
Return the leftmost nodes at each level as the left view of the binar
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
The task is to determine the number of islands in a grid consisting of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Mark visited 1s as 0 to avoid counting them again.
Increment the island count each time a new island is found.
Consider all 8 adjacent cells (horizontally, vertically, diagonally) while performing DFS.
Handle edge cases like out of bounds and already visited ce
Round duration - 60 minutes
Round difficulty - Medium
This was a 60 min technical interview round. The interviewer asked me to code 2 programming questions.
Tip : Practice more to clear DSA problems. Medium level questions will be enough to clear the rounds.
Given a Directed Acyclic Graph (DAG) consisting of V
vertices and E
edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...
Implement a function to find any topological sorting of a Directed Acyclic Graph (DAG).
Use Depth First Search (DFS) to traverse the graph and add vertices to the result in reverse order of finishing times.
Maintain a visited array to keep track of visited vertices to avoid revisiting them.
Start DFS from any unvisited vertex and recursively explore its neighbors.
Once all neighbors are visited, add the current vertex to t...
You are provided with a Singly Linked List containing integers. Your task is to determine the N-th node from the end of the list.
If the list is...
Find the N-th node from the end of a Singly Linked List containing integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
Handle edge cases like N being equal to 1 or equal to the length of the list.
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 was interviewed in Jul 2021.
Round duration - 45 minutes
Round difficulty - Medium
It was an online coding round where we were supposed to solve 2 coding questions in 45 minutes.
Given the schedule of N meetings with their start time Start[i]
and end time End[i]
, you need to determine which meetings can be organized in a single meeting room such ...
Given N meetings with start and end times, determine the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on their end times.
Iterate through the sorted meetings and select the first meeting that does not overlap with the previous one.
Repeat the process until all meetings are considered.
Return the selected meetings in the order they are organized.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Given 'N' ropes of varying lengths, find the minimum cost to connect all ropes into one single rope.
Sort the lengths of ropes in ascending order.
Keep connecting the two shortest ropes at each step.
Update the total cost by adding the lengths of the connected ropes.
Repeat until all ropes are connected.
Return the total cost as the minimum cost to connect all ropes.
Round duration - 60 minutes
Round difficulty - Medium
The interview was conducted online. The interviewer asked me 2 programming questions and questions on OOPS concepts.
Given a binary tree, determine and return its bottom view when viewed from left to right. Assume that each child of a node is positioned at a 45-degree angle from its parent.
N...
Given a binary tree, return the bottom view of the tree when viewed from left to right.
Traverse the tree level by level and keep track of the horizontal distance of each node from the root.
For each horizontal distance, store the node with the maximum depth in a map.
After traversing the entire tree, return the values of the map in sorted order of their horizontal distance.
Given a binary tree of integers, your task is to implement serialization and deserialization methods. You can choose any algorithm for serialization...
Implement serialization and deserialization methods for a binary tree of integers.
Use level order traversal for serialization and deserialization.
Use -1 to represent null nodes in the binary tree.
Ensure the serialized string can be correctly decoded back to form the original binary tree.
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a base class pointer.
Virtual destructors are declared with the 'virtual' keyword in the base class to allow proper cleanup of derived class objects.
When deleting an object through a base class pointer, having a virtual destructor ensures that the destructor of the derived class is called.
Without a virtual...
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 4 : One should have strong DSA skills and knowledge of Basic OOPS. Its not necessary to learn OS and DBMS if it's not taught in your college yet.
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 Jul 2021. There were 3 interview rounds.
Interview questions for Software Developer Intern
Maximum meetings in one room can be calculated using greedy approach
Bottom view of tree can be obtained using level order traversal and a map to store horizontal distance
Serialization and deserialization of binary tree can be done using preorder traversal
Virtual destructor in Java is automatically called while in C++ it needs to be explicitly defined
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Hard
Round was scheduled in the early afternoon hours most probably from 1 to 2 on hackerrank.
Given a binary search tree (BST) with 'N' nodes, the task is to convert it into a Greater Tree.
A Greater Tree is defined such that every node's value in the origina...
Convert a binary search tree into a Greater Tree by replacing each node's value with the sum of all values greater than or equal to it.
Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.
Keep track of the running sum of visited nodes and update each node's value with this sum.
Recursively apply the above steps to all nodes in the BST.
Example: Input - 4 1 6 0 2 5 7 -1 -1 -1 3 -1 -1 ...
Ninja has a binary string S
of size N
given by his friend. The task is to determine if it's possible to sort the binary string S
in decreasing order by removing a...
Determine if a binary string can be sorted in decreasing order by removing non-adjacent characters.
Check if the count of '1's in the string is equal to the length of the string, in which case it can be sorted in decreasing order.
If there are multiple '0's between two '1's, they can be removed to sort the string in decreasing order.
If there are more '0's than '1's, it is not possible to sort the string in decreasing ord
Round duration - 40 minutes
Round difficulty - Medium
This round was conducted on Code Share platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 25th August and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Implement a function to return the spiral order traversal of a binary tree given in level order.
Traverse the binary tree in a spiral order, alternating between left to right and right to left.
Use a queue to keep track of nodes at each level and a flag to switch direction.
Handle null nodes appropriately to maintain the spiral order traversal.
Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5
Tip 1 : Prepare DSA Questions from coding ninja or interview bit
Tip 2 : Have knowledge about SQL and datbases
Tip 3 : Practice Atleast 200 coding questions from gfg
Tip 1 : Attach links to coding profiles
Tip 2 : Mention short description of your team projects and individual as well
Arcesium interview questions for designations
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Hard
Timing (Between 6pm -7pm)
Environment was friendly and 2 coding questions were given.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Connect ropes with minimum cost by merging smallest ropes first.
Sort the lengths of ropes in ascending order.
Merge the two smallest ropes at a time to minimize cost.
Repeat the merging process until all ropes are connected.
Calculate the total cost by summing up the lengths of merged ropes.
Return the minimum cost obtained.
Alex wants to maximize the use of 'K' memory spaces on his computer. He has 'N' different document downloads, each with unique memory usage, and 'M' computer games,...
Maximize memory usage by pairing downloads and games within memory limit 'K'.
Sort downloads and games in descending order.
Iterate through downloads and games to find the pair with maximum memory usage.
Return the indices of the selected download and game pairs.
Round duration - 40 minutes
Round difficulty - Medium
Timing (6pm -7 pm)
Environment was user friendly
In first 10-15 minutes He asked my current company’s work and some behavioral questions. Then he jumped to coding problems
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Implement a function to output the Spiral Order traversal of a binary tree given in level order.
Traverse the binary tree in a spiral order, alternating between left to right and right to left at each level.
Use a queue to keep track of nodes at each level and a stack to reverse the order of nodes at odd levels.
Handle null nodes appropriately to maintain the spiral order traversal.
Example: Input: 1 2 3 -1 -1 4 5, Output:
Tip 1 : Prepare DSA Questions from coding ninja or interview bit
Tip 2 : Have knowledge about SQL and datbases
Tip 3 : Practice Atleast 200 coding questions from gfg
Tip 1 : Have some good projects Web Dev projects are preferred
Tip 2 : Resume should be of 1 page
Get interview-ready with Top Arcesium Interview Questions
Top trending discussions
Finding smallest of 4 numbers without using >.< and min function in Java.
Initialize a variable with the first number
Compare it with the remaining numbers using if-else statements
If a smaller number is found, update the variable
Repeat until all numbers are compared
The final value of the variable will be the smallest number
Code for palindrome checking
Convert the input to lowercase to ignore case sensitivity
Use two pointers, one at the start and one at the end of the string
Compare the characters at both pointers and move them towards each other
If all characters match, it's a palindrome
Javascript code to display 'Hello World!' on the webpage
Create a new HTML file
Add a script tag with 'type' attribute set to 'text/javascript'
Inside the script tag, use document.write() to display 'Hello World!'
Swap two numbers without using a temporary variable.
Use addition and subtraction to swap the values
Use XOR operator to swap the values
Use multiplication and division to swap the values
To add 2 tables, we need to use a join operation on a common column.
Identify the common column between the tables
Choose the appropriate join type (inner, outer, left, right)
Write the SQL query to join the tables
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
Union combines and removes duplicates, Union All combines all rows including duplicates.
Union is used to combine the result sets of two or more SELECT statements and remove duplicates.
Union All is used to combine the result sets of two or more SELECT statements and includes all rows, including duplicates.
Union is slower than Union All as it has to remove duplicates.
Union requires the same number of columns in all SELEC...
Being assigned a project with unrealistic deadlines and minimal guidance
Received a project with tight deadlines and unclear requirements
Struggled to meet the deadlines due to lack of guidance and support
Had to work long hours and weekends to try to complete the project
Learned the importance of clear communication and setting realistic expectations
I was interviewed in Sep 2017.
Senior Analyst
318
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
314
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
223
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
186
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
153
salaries
| ₹0 L/yr - ₹0 L/yr |
Edelweiss
JPMorgan Chase & Co.
Goldman Sachs
Morgan Stanley