Round 1 – Online Coding (HackerRank)
- LFU Cache Implementation with capacity c and key value pair
- Given a height of tunnel H and array for heights of cats, calculate minimum time taken by all cats to cross the tunnel. At one time only one cat can cross the tunnel, One cat can hope on another cat’s back to cross the tunnel. u is the time for single cat and v is time for lower height cat on back of a cat
- Sort array such that the sum of the output of all queries will be maximum. Each query will be sum of elements from i to j
Round 2 – Technical Interview 1 (Hyderabad Office)
- Discussion about current company and work that i do there
- Printing linked list with down and next pointer in level order
- Print all node at given distance from give node in a tree
- OOPS concepts
- Virtual memory and Paging
- Building C++ project steps and Compiler working
Round 3 – Technical Interview 2 (Hyderabad Office)
- Discussion about current company
- BFS – Given flights from various location, tell weather its possible to travel from one location?
- Dijiksta Algorithm?
- Deadlock conditions and how to solve it?
- Inheritance & abstraction?
- Parking lot design?
Round 4 – HR Interview (Telephonic)
- Why you want to leave your current company?
- Why Arcesium?
- Different situations and how you will handle them?
- What can be the reasons for you to leave any company?
- How much hike do you expect?