Arcesium Interview Experience – Senior Software Engineer (3 years experience)
Round 1: Online HackerRank
There were 3 questions.

Find the smallest positive integer value that cannot be represented as sum of any subset of a given array. https://www.geeksforgeeks.org/findsmallestvaluerepresentedsumsubsetgivenarray/

Generate two BSTs from the given array such that maximum height among them is minimum. https://www.geeksforgeeks.org/generatetwobstsfromthegivenarraysuchthatmaximumheightamongthemisminimum/
 Given a rod of length n inches and an array of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces. https://www.geeksforgeeks.org/cuttingaroddp13/
I solved the first 2 problems and was called for a F2F round in Hyderabad the following weekend.
F2f Round 2:
There were 3 rounds to F2f and each one was elimination based.
 There were three questions in the first round
 If you have a list of cups where each value represents a cups diameter, and the lower diameter cup can be put in the higher diameter cup (and cups of the same diameter cannot be stacked on top of each other), then devise a strategy to stack them. I suggested using a HashMap which would store the cup as key and value as the count. Then iterate over HashMap and decrement the count, as you iterate over the HashMap. So for cups = [1, 2, 3, 4, 6, 1, 2, 3], the hashmap would look map = {1:2, 2:2, 3:2, 4:1, 6:1}. Then you could just decrement the count on iterating over the hashmap to find the number of stacks. He asked me complexity and i answered O(n*2) as ill be iterating over the HashMap again and again and populating it too one time. Then I was asked if i can do it in one pass of HashMap. I couldnt answer this, and over discussion realized that the max of the value is the minimum number of stacks required.
 If you have a list of prices for a day time wise and given two transaction opportunities, what two transaction would you make. I could not solve this https://www.geeksforgeeks.org/stockbuysell/.
 Find intersection of two lists. I suggested hashing method first, and he asked me to improve it. So I suggested the difference in length method. https://www.geeksforgeeks.org/writeafunctiontogettheintersectionpointoftwolinkedlists/
 There were two questions in the second round: –
 Find next greater number. 1234 – > 1324. I could not solve this. https://www.geeksforgeeks.org/findnextgreaternumbersetdigits/
 Program to check if tree is BST or not. https://www.geeksforgeeks.org/aprogramtocheckifabinarytreeisbstornot/
As it was elimination round, and I could only do 1 question in second round of F2F, I was eliminated.
All in all I felt that the process got a little difficult in the second round, in terms of help and also questions. The entire process was good with the interviewer helping a lot in the first round with each question and the HR arranged all the travel tickets. Basically it is heavy on DS, Algorithms and Java.
Recommended Posts:
 Microsoft Interview Experience  Senior Software Engineer (4 Years Experienced)
 Arcesium Senior SE Interview Experience
 Arcesium Interview Experience Software Engineer (1+ year experience)
 Arcesium Interview Experience  Set 5 (3+ years experience  Developer profile)
 CloudElements Senior Software Engineer Interview Experience
 MakeMyTrip Interview Experience  Set 17 (Senior Software Engineer)
 PayU Interview Experience  Senior Software Engineer
 BrowserStack Interview Experience  Senior Software Engineer
 FreeCharge Interview Experience for Senior Software Engineer
 Myntra Interview Experience  Set 4 (For Senior Software Engineer )
 Stryker Interview Experience  Senior Software Engineer  Gurugram
 Progress Company Interview Experience  Set 1 (Senior Software Engineer)
 Lynk Logistics Interview Experience  Senior Software Engineer
 Interview Experience with Yatra(Hyderabad)  Set 3 (For Senior Software Engineer)
 Arcesium Interview Experience for 2+ years Experienced
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.