Upload Button Icon Add office photos

Arcesium

Compare button icon Compare button icon Compare

Filter interviews by

Arcesium Software Developer Intern Interview Questions, Process, and Tips

Updated 6 Jan 2022

Top Arcesium Software Developer Intern Interview Questions and Answers

  • 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 ro ...read more
  • 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 ...read more
  • Q3. 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 orga ...read more
View all 14 questions

Arcesium Software Developer Intern Interview Experiences

5 interviews found

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

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...

  • 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
  • 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...

  • 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
Round 2 - Video Call 

(2 Questions)

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 ...

  • 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...

  • Answered by AI
  • 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...
  • 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

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAArcesium interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Jul 2021.

Round 1 - Coding Test 

(2 Questions)

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 ...

  • 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
  • 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...

  • 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
Round 2 - Video Call 

(3 Questions)

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...

  • 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
  • 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...

  • 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
  • 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...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAArcesium interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I applied via Campus Placement and was interviewed in Jul 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 1) Maximum meetings in one room 2)Bottom view of tree 3) Serialize deserialize binary tree 4) Difference between Virtual destructor in java and c++
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 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

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

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...

  • 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
  • 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,...

  • 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
Round 2 - Video Call 

(1 Question)

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...
  • 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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 7 cgpaArcesium interview preparation:Topics to prepare for the interview - Operating System, System Design, Data structure, Trees, Graph, Dynamic ProgrammingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Have some good projects Web Dev projects are preferred
Tip 2 : Resume should be of 1 page

Final outcome of the interviewSelected

Skills evaluated in this interview

Arcesium interview questions for designations

 Software Engineer Intern

 (1)

 Software Developer

 (1)

 SDE Intern

 (1)

 Intern

 (1)

 Software Engineer

 (6)

 Finance Intern

 (1)

 Senior Developer

 (1)

 Senior Software Engineer

 (7)

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

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...

  • 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 ...

  • Answered by AI
  • 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...

  • 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
Round 2 - Video Call 

(1 Question)

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...
  • 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

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in HyderabadEligibility criteriaComputer science allowedArcesium interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Attach links to coding profiles
Tip 2 : Mention short description of your team projects and individual as well

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Arcesium Interview Questions

Interview questions from similar companies

I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Anything can be asked from oops to design pattern level question. Simple to hard. It's kind of rapid fire.

Interview Preparation Tips

Interview preparation tips for other job seekers - Ready handle a pressure while interview process, be stable, don't confuse

I appeared for an interview in Sep 2020.

Interview Questionnaire 

1 Question

  • Q1. Oops concept, solid principles, filters in MVC, basics of Angular,life cycle hook

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 rounds- both are technical.

I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Java programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Overall good experience attending interview

I applied via Walk-in and was interviewed before Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. How to compile all Java files inside a folder using Cmd
  • Ans. 

    To compile all Java files inside a folder using Cmd, navigate to the folder and run 'javac *.java'

    • Open Command Prompt and navigate to the folder containing the Java files

    • Run the command 'javac *.java' to compile all Java files in the folder

    • Check for any errors or warnings in the output

  • Answered by AI
  • Q2. Internal working of Hashmap and Concurrent Hashmap
  • Ans. 

    Hashmap is a data structure that stores key-value pairs. Concurrent Hashmap is a thread-safe version of Hashmap.

    • Hashmap uses hashing to store and retrieve elements based on their keys.

    • Concurrent Hashmap allows multiple threads to access and modify the map concurrently.

    • Hashmap has a load factor that determines when the map needs to be resized.

    • Concurrent Hashmap uses a technique called lock striping to allow concurrent a...

  • Answered by AI
  • Q3. Servlet : Listeners, Filters related questions
  • Q4. Java 8 features

Interview Preparation Tips

Interview preparation tips for other job seekers - Work on Core Java Concepts

Skills evaluated in this interview

I applied via Walk-in and was interviewed before Apr 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic questions on Java. Spring MVC flow, collections, projects that you've worked on

Interview Preparation Tips

Interview preparation tips for other job seekers - This is a easy discussion. Just portray your strong points and just indirectly force them to ask you're question related to the same.

Tell us how to improve this page.

Senior Analyst
345 salaries
unlock blur

₹9.5 L/yr - ₹29.5 L/yr

Analyst
321 salaries
unlock blur

₹7.6 L/yr - ₹20.5 L/yr

Senior Software Engineer
236 salaries
unlock blur

₹15 L/yr - ₹43 L/yr

Software Engineer
186 salaries
unlock blur

₹9 L/yr - ₹33 L/yr

Financial Analyst
157 salaries
unlock blur

₹8.5 L/yr - ₹19 L/yr

Explore more salaries
Compare Arcesium with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

3i Infotech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview