Arcesium Senior SE Interview Experience

Round 1:

Hacker Rank Test
1. Stock value decreases value by 1 or multiplied by 2 end of every day. Given Stock of price x. How many days does it take to become y .
2. Given Array of integers, maximum segment length such that product is positive.
3.One ore question of similar difficulty.

Round 2:

  • Quick Introduction.
  • What is the database used in current company?
  • When should we use no sql over sql.
  • in terms of performance how can no sql perform better.
  • What is costlier – read or write to db.
  • Explain index.
  • https://leetcode.com/problems/merge-intervals/
  • Difference between sleep() and wait().
  • Difference between synchronized and lock interface.
  • What java version do we use and if we use any of the java 8 features in the code.

Round 3:

  • https://www.geeksforgeeks.org/minimum-number-of-swaps-required-for-arranging-pairs-adjacent-to-each-other/
  • https://www.geeksforgeeks.org/rearrange-linked-list-alternate-first-last-element/
  • https://www.geeksforgeeks.org/diameter-of-a-binary-tree/
  • https://www.geeksforgeeks.org/continuous-tree/

You can only spend n hours in library . You have list of books and amount of time to read it. But you can only read in the given order . For example you have n=12 hrs and time to read books is 5, 2, 1, 3, 9, 5, 1, 3 Ans: 4 [5, 2, 1, 3, ] .



For n=12 and time – 5, 2, 1, 3, 9, 5, 1, 3, 2, 1, 4   Ans: 5 [1, 3, 2, 1, 4]

We agreed that we could solve it using sliding window approach.

Normalization

Quick discussion about AVL and red black trees

Hashmap, Hashtable

Round 4:

  • Mutable Classes
  • Locking classes and objects
  • Low level design for BookMyShow
  • Why would you choose SQL over no sql
  • ACID properties

 

Each round is properly time boxed and lasted around 40-60 mins. Rounds 2-4 happened on same day . Recruiters planned them really well, no waiting time and quick feedback for next rounds.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

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.


Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.