Upload Button Icon Add office photos

Arcesium

Compare button icon Compare button icon Compare

Filter interviews by

Arcesium Senior Developer Interview Questions and Answers

Updated 20 Jun 2024

Arcesium Senior Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in May 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Coding round with just one medium question. Not much complexity but, too much coding.

Round 2 - Coding Test 

A two pointer question with medium level complexity like find distance to nearest 1 in an array of 1s and zeroes

Round 3 - System design 

(2 Questions)

  • Q1. System design scenarios using sqs
  • Ans. 

    Using SQS for system design scenarios

    • Implementing a message queue system for decoupling components

    • Scaling the system by adding more SQS queues for different functionalities

    • Using SQS to handle asynchronous processing of tasks

    • Integrating SQS with other AWS services like Lambda for serverless architecture

  • Answered by AI
  • Q2. System design scenarios for enough monitoring and alarming
  • Ans. 

    Implementing system design scenarios for monitoring and alarming

    • Utilize monitoring tools like Prometheus, Grafana, or Nagios to collect and visualize data

    • Set up alerts based on predefined thresholds for key metrics

    • Implement a centralized logging system like ELK stack to track system behavior

    • Utilize distributed tracing tools like Jaeger or Zipkin to monitor request flows

    • Implement health checks for services to ensure the

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing specific. But, good is not good enough as they compare your performance with few others

Skills evaluated in this interview

Interview questions from similar companies

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. Explain the background process that takes place during an atm transaction
  • Ans. 

    ATM transaction involves multiple background processes including authentication, authorization, and communication with bank servers.

    • Customer inserts card and enters PIN

    • ATM authenticates the card and PIN

    • ATM requests authorization from bank server

    • Bank server verifies account balance and approves or denies transaction

    • ATM dispenses cash or completes other requested transaction

    • ATM updates account balance and sends transacti

  • Answered by AI
  • Q2. Cut cake into 8 pieces .You can use knife 3 times only
  • Ans. 

    Cut cake into 8 pieces using knife 3 times only.

    • First, cut the cake horizontally into two equal halves.

    • Then, cut the cake vertically into four equal pieces.

    • Finally, cut the cake horizontally again into eight equal pieces.

    • Make sure to use the knife efficiently to minimize the number of cuts.

    • Practice visualization before making the cuts to avoid mistakes.

  • Answered by AI
  • Q3. A shot fired from a gun pointing towards a tree full of birds. All birds left except one. Why ?
  • Ans. 

    The one bird was already dead.

    • The bird was already dead before the shot was fired.

    • The bird was injured and unable to fly away with the rest of the birds.

    • The bird was a decoy bird used for hunting purposes.

    • The bird was a trained bird used for falconry.

  • Answered by AI
  • Q4. Explain projects which you made in college?
  • Ans. 

    Developed a web-based attendance management system and a mobile app for event management.

    • Created a database schema and implemented CRUD operations using PHP and MySQL.

    • Designed the user interface using HTML, CSS, and JavaScript.

    • Integrated Google Maps API for location tracking in the mobile app.

    • Implemented push notifications using Firebase Cloud Messaging.

    • Collaborated with a team of four to complete the projects within t

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The question paper was a mix of aptitude, programming of c++ java , sql and reasoning.
There was negative marking set for each questions.
Tips: Attempt that portion first in which you are really confident.
Dont try to attempt all questions , as negative marking plays big role.
Duration: 60 minutes

Round: Technical Interview
Experience: As Barclays is a bank , so this kind of question is obvious.
Be prepared for technical process that takes place in a usual banking domain.
Also , any type of question whether reasoning based or technical can be asked.
Tips: Be confident. Try to tell everything in a straight manner.

Round: Case Study Interview
Experience: You can put humour while answering as this shows your positivity.
There can be many reason for this like birds ia dead , bird is deaf , bird is of plastic. You can choose whatever hit into your mind.

Round: Behavioural Interview
Experience: Explaining the thing in which you already have knowledge is a plus point.
But make sure you have complete knowledge of your college project as they can ask as many questions as possible because your project is the main thing which can extend your interview time.

Skills: Common Sense, Presence Of Mind, Positive Thinking, Ability To Deliver On A Project, C Programming
College Name: UPTU
Motivation: As it is a product based company , so chances of growth is good and pay scale is better.

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: Was nice experience,should have good aptitude.
Tips: Learn aptitude more and morr
Duration: 60 minutes

Round: Group Discussion
Experience: Just speak about the topic
Tips: Do not get silent

Round: Technical Interview
Experience: iOS,C/C++
Tips: Just be confident about your answwers ansd show that you are capable to do each and everything in this world and you have quick learning capacity to grasp anything.

General Tips: C/C++,
Skills:
College Name: CDAC PUNE
Motivation: Bank more than 325 years old.

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Interview Questionnaire 

11 Questions

  • Q1. Print all nodes at a distance k from a given node in binary tree?
  • Q2. RandN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, write a code for rand7 using rand5
  • Ans. 

    Code for rand7 using rand5 function

    • Use rand5 twice to generate a number in [1,25] with equal probability

    • If the number is greater than 21, discard and try again

    • Otherwise, return (number mod 7) + 1

  • Answered by AI
  • Q3. Puzzle: Using all(8,8,3,3) and only operators(*,/,-,+), make 24
  • Q4. How do you implement LRU cache?
  • Ans. 

    LRU cache is implemented using a doubly linked list and a hash map.

    • Create a doubly linked list to keep track of the order of elements in the cache.

    • Create a hash map to store the key-value pairs of the cache.

    • When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

    • When an element is accessed, move it to the front of the linked list to...

  • Answered by AI
  • Q5. Your current project in Company? A lot of questions from CV? Discussion went on for about 15 minutes?
  • Q6. Then had a lot of questions around java script and java. About different design patterns and web services
  • Q7. A lot of questions around java, collections frameworks, multi threading and so on. (This took a good 25-30 minutes )
  • Q8. A strategy question. It would be asked depending on which team you are being interviewed for.Mine was some apple seller problem. Here knowledge of real world scenario helps. Advice is to observe things aro...
  • Q9. Write down function to select pivot element randomly in Quick Sort
  • Ans. 

    Function to randomly select pivot element in Quick Sort

    • Generate a random index within the range of the array

    • Return the element at the randomly generated index as the pivot

  • Answered by AI
  • Q10. He asked me what is a data structure and why do we use one. Explained him. He asked some real life example of stack and queue. All I could gave him was programming examples but when he insisted on real li...
  • Q11. As we were talking very much on each question. He felt like talking more and from tech he went around for some biggest learning from a mistake/biggest achievement of life kind of questions. There were oth...

Interview Preparation Tips

General Tips: I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore.
Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, 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 was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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

Interview Questionnaire 

11 Questions

  • Q1. What is the difference between multi tasking, multi processing and multi programming operating systems with examples ?
  • Ans. 

    Multi tasking, multi processing, and multi programming are different approaches to managing tasks in an operating system.

    • Multi tasking allows multiple tasks to run concurrently on a single processor.

    • Multi processing involves multiple processors running tasks simultaneously.

    • Multi programming allows multiple programs to be loaded into memory and executed concurrently.

    • Examples of multi tasking operating systems include Wi...

  • Answered by AI
  • Q2. Tell me about memory allocation (stack vs. heap)?
  • Ans. 

    Memory allocation refers to the process of assigning memory to programs during runtime.

    • Stack allocation is done automatically and is limited in size.

    • Heap allocation is done manually and is larger in size.

    • Stack memory is used for local variables and function calls.

    • Heap memory is used for dynamic memory allocation.

    • Memory leaks can occur if heap memory is not properly managed.

  • Answered by AI
  • Q3. You have two threads one printing even numbers in order and other odd numbers. Design an algorithm so that it prints numbers in natural order?
  • Ans. 

    Use a shared variable and synchronization mechanisms to ensure natural order printing of numbers.

    • Create two threads, one for printing even numbers and the other for printing odd numbers.

    • Use a shared variable to keep track of the current number to be printed.

    • Implement synchronization mechanisms like locks or semaphores to ensure only one thread can access the shared variable at a time.

    • Each thread should check if it is i...

  • Answered by AI
  • Q4. Print a matrix in spiral order?
  • Ans. 

    Printing a matrix in spiral order

    • Start from the first element and print it

    • Move in a spiral order towards the center of the matrix

    • Repeat until all elements are printed

  • Answered by AI
  • Q5. Thread class and Runnable Interface?
  • Ans. 

    Thread class and Runnable Interface are used for multithreading in Java.

    • Thread class is a predefined class in Java that provides methods to create and control threads.

    • Runnable interface is used to define a task that can be executed by a thread.

    • Thread class implements Runnable interface.

    • Thread class provides more control over threads than Runnable interface.

    • Example: Thread t = new Thread(new MyRunnable()); t.start();

    • Exa...

  • Answered by AI
  • Q6. What’s the difference between a Linked List and an ArrayList and give me an example of when to use which?
  • Ans. 

    Linked List is a dynamic data structure while ArrayList is a static data structure.

    • Linked List is best for frequent insertion and deletion operations.

    • ArrayList is best for frequent access operations.

    • Linked List uses more memory than ArrayList.

    • ArrayList is faster than Linked List for accessing elements.

    • Use Linked List when you need to frequently add or remove elements from the list.

    • Use ArrayList when you need to frequen

  • Answered by AI
  • Q7. Questions of OS concepts?
  • Q8. A role play scenario was given. With a clear instruction on I don’t need to know the basis and the hypothetical assumption was presented. I was told that I was expected to respond to the given scenario, in...
  • Q9. Why are you interested in a career in investment banking?
  • Ans. 

    I am not interested in a career in investment banking.

    • I am more interested in a career in software development

    • I enjoy problem-solving and creating innovative solutions through coding

    • Investment banking does not align with my passion and skill set

  • Answered by AI
  • Q10. Why have you chosen to apply to J.P. Morgan?
  • Ans. 

    I have chosen to apply to J.P. Morgan because of their reputation, global presence, and opportunities for growth.

    • J.P. Morgan has a strong reputation in the financial industry.

    • They have a global presence with offices in multiple countries.

    • The company offers various opportunities for career growth and development.

    • J.P. Morgan is known for its innovative technology solutions in the financial sector.

    • I am impressed by their ...

  • Answered by AI
  • Q11. Have you ever made a mistake? Tell us about it?
  • Ans. 

    Yes, I have made a mistake in my previous project.

    • I underestimated the complexity of a task and ended up missing the deadline.

    • I failed to properly test a feature, resulting in a bug that affected user experience.

    • I accidentally deleted an important file without having a backup.

    • I misunderstood a requirement and implemented a feature incorrectly.

  • Answered by AI

Interview Preparation Tips

Round: Test
Total Questions: 1

General Tips: Interview Process: Aptitude test, followed by 3 rounds of interview. Interview process was very good. Just be positive to clear the interview.
Check this link before appearing for interview with JP Morgan. It will help  -----
Skills: Algorithm, Data structure, Stack
College Name: Na

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Telephonic Call 

Round duration - 60 minutes
Round difficulty - Easy

The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.

Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me two coding questions in this round.

  • Q1. Write an efficient program to find the sum of the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
  • Ans. 

    Efficient program to find sum of largest contiguous subarray within a one-dimensional array.

    • Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.

    • Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.

    • Return max_sum as the result.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.

  • Q1. 

    DFS Traversal Problem Statement

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

  • Ans. 

    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

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was the third round of the onsite interview. 
 

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - 1 in BangaloreGoldman Sachs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Database, System Design, Operating SystemsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.

Application resume tips for other job seekers

Keep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Referral and was interviewed before Sep 2019. There were 3 interview rounds.

Interview Questionnaire 

8 Questions

  • Q1. Java logical question
  • Q2. Webdriver architecture
  • Q3. Framework, file and folder structure
  • Q4. Your approach to tackle dynamic objects
  • Ans. 

    I approach dynamic objects by analyzing their behavior and adapting my approach accordingly.

    • I start by understanding the nature of the dynamic object and its expected behavior

    • I then analyze its movement patterns and any potential obstacles or hazards

    • Based on this analysis, I adapt my approach to ensure safe and efficient interaction with the dynamic object

    • For example, when working with a moving conveyor belt, I would e...

  • Answered by AI
  • Q5. Implicit and explicit wait in selenium
  • Ans. 

    Implicit and explicit wait are two types of wait in Selenium used to synchronize the test execution with the application.

    • Implicit wait is used to set a default waiting time for the web elements to load before throwing an exception.

    • Explicit wait is used to wait for a specific condition to occur before proceeding with the test execution.

    • Implicit wait is set globally for the entire test script while explicit wait is set f...

  • Answered by AI
  • Q6. Java oops concepts
  • Q7. Sql queries related to joins
  • Q8. Basic Unix commands

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and try to connect yours answers with some example of your project.

Skills evaluated in this interview

Arcesium Interview FAQs

How many rounds are there in Arcesium Senior Developer interview?
Arcesium interview process usually has 3 rounds. The most common rounds in the Arcesium interview process are Coding Test.
What are the top questions asked in Arcesium Senior Developer interview?

Some of the top questions asked at the Arcesium Senior Developer interview -

  1. System design scenarios for enough monitoring and alarm...read more
  2. System design scenarios using ...read more

Tell us how to improve this page.

Arcesium Senior Developer Interview Process

based on 2 interviews

Interview experience

4
  
Good
View more
Senior Analyst
318 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Analyst
314 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
227 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
186 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Financial Analyst
153 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Arcesium with

Edelweiss

3.9
Compare

JPMorgan Chase & Co.

4.0
Compare

Goldman Sachs

3.5
Compare

Morgan Stanley

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