Round 1: Online Coding Test.

Round 2: DataStructure and Algorithm

1. Given an array and a target.
   find the three indices which will add up to target;
   arr = [1,2,3,4,5,5,6,7];
   target = 6;

2. arr = [‘apple’, ‘orange’, ‘apple’, ‘orange’, ‘apple’, ‘kiwi’, ‘kiwi’, ‘grapes’, ‘banana’];
   question:
   part 1: arrange the fruits decending order of their count.
   part 2: if frequency is same arrange them based on their alphabatical order.
   output= [apple, apple, apple, kiwi, kiwi, orange, orange, banana, grapes];

Round3 : System Design(HLD+LLD)

1. How do you do code review?
2. Solid Principle. (Explain in depth interface seggregation and Liskov substitution)
3. Singleton , factory, abstract factory, decorator, template
4. design a System such that if a client send account number it should be returning account balance.
5. Producer consumer problems/
6. Implement LRU cache.

Round 4; HM
Behavioral + Project Architecture and few followups on that,

Verdict : Selected.