Round 1: Virtual Online Assessment involving 3 Ques(Easy, Med, Hard) i don't remember the questions exactly
Round 2: OnSite Coding Assessment having 4 Ques (Easy, Med, Hard, Complex)
Easy: Given an Array First Add all odd index and even index then give sum_odd - sum_even elements then swap odd and even sum and do sum_even - sum_odd and return minimum out of these
Medium & Hard i don't remember but they were of Greedy and DP as well
Complex: Given 2 grids say Grid1 and Grid2 then calculate minimum path sum from (0,0) cell to (n,m) cell i.e Bottom Right cell and we can switch grids with a cost of S
Personal Tip: You could easily Solve all 4 questions but passing all Hidden Test Cases is Tough so Focus on Writing Optimal Code so you don't get stuck
Round 3: Onsite Interview at Noida (Galgotias University)
Very ImportantFor Interview Resume is of Utmost Importance
All the best!