Arcesium Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Hard

Round was scheduled in the early afternoon hours most probably from 1 to 2 on hackerrank.

Q1. 
BST to Greater Tree Problem Statement
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...read more
Ans. 
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 ...read more
Answered by AI
Add your answer
Q2. 
Ninja and Binary String Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer

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.

Q1. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

Timing (Between 6pm -7pm)
Environment was friendly and 2 coding questions were given.

Q1. 
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. 
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.
Answered by AI
Add your answer
Q2. 
Optimize Memory Usage Problem Statement
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,...read more
Ans. 
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.
Answered by AI
Add your answer

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

Q1. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
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:
Answered by AI
Add your answer