it consists of 1 OA round and 1 technical interview consisting of 2 coding problems with medium difficulty based on tree and dynamic programming. Specifically it was common ancester problem and house robbery problems of leetcode which i was asked during my interview.Talking about my OA it consists of basic array questions which was easy to be done using single for loop and hashMap and hashset.