Round 1: (Coding test) We have been asked to solve 4 DSA questions in 3hrs Question1: Should be easy mostly but in our slot it was a medium level question we need to extract length of max subarray with xor of all elemnts equal to given x and no elemnt in the subarray should occur more than k times. Question 2: This a easy question on array modification and simple counting Question 3 and Question 4: Thes are Hard Question which need to be solved using segment trees. I solved 1st question half , 2nd question fully and 4th question half. so i was selected for l1 role which is typically 11lpa Interview process: They started with core cs and dbms questions like unique key vs primary key, what is multithreading, internal fragmentation,normal forms, e.t.c Next they asked 2 sql queries one involving like and other involing groupby and aggregation functions Next they asked DSA question: in an array we should have index ia[j] count number of pairs satisifying this condition asked to write optimal solution which i wrote (it is O(nlogn). And a very small project discussion.