Arcesium Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Medium

2 coding questions were given to solve in 45 minutes.

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...read more
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 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
Answered by AI
Add your answer
Q2. 
Number of Islands Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer

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.

Q1. 
Topological Sort Problem Statement
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 ...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
N-th Node From The End Problem Statement
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.
Example:
Input:
If the list is...read more
Ans. 
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.
Answered by AI
Add your answer

Q1. What is Equity Swap, black scholes, option pricing, type of risks, what is CAPM
Ans. 
Equity Swap, Black Scholes, Option Pricing, CAPM are all financial concepts related to risk management and investment analysis.
• Equity Swap is a financial contract between two parties to exchange cash flows based on the performance of an underlying asset.

• Black Scholes is a mathematical model used to calculate the theoretical value of European-style options.

• Option Pricing is the process of determining the fair value of a...read more
Answered by AI
Add your answer
Q2. Fund accounting questions
Add your answer

Q1. Dcf valuation, Multiples valuation
Add your answer

Q1. Minimum weight to reach bottom right corner in matrix starting from top left. you can move only down and right
Ans. 
The minimum weight to reach the bottom right corner in a matrix starting from the top left by moving only down and right.
• Use dynamic programming to calculate the minimum weight at each cell by considering the weights of the cells above and to the left.

• At each cell, the minimum weight to reach that cell is the minimum of the weight of the cell itself plus the minimum weight of the cells above and to the left.

• Example: Fo...read more
Answered by AI
Add your answer

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.

Q1. 
Maximum Meetings Problem Statement
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 ...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Connecting Ropes with Minimum Cost
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was conducted online. The interviewer asked me 2 programming questions and questions on OOPS concepts.

Q1. 
Bottom View of Binary Tree
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Serialize and Deserialize Binary Tree Problem Statement
Given a binary tree of integers, your task is to implement serialization and deserialization methods. You can choose any algorithm for serialization...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. Can you explain the concept of virtual destructors in C++?
Ans. 
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...read more
Answered by AI
Add your answer