There were total of 3 rounds.
Round 1: Aptitude
20 MCQs which included SQL, OS,C,C++ and 2 coding questions
1. https://www.geeksforgeeks.org/sum-of-all-possible-expressions-of-a-numeric-string-possible-by-inserting-addition-operators/
2. The Missing Prisoner Prisoners are standing on a Cartesian coordinate system present inside a jail. Each prisoner stands at a unique point with both the coordinates (x,y) being integers. Each prisoner should be at a position that forms a rectangle or square with 3 other prisoners. More formally, every prisoner at a coordinates pair [x, y] should have: at least one prisoner standing at integer coordinates (x. ay) where ay != y. at least one prisoner standing at integer coordinates [bx, y] where bx != x. Unfortunately, one prisoner has escaped. Find the coordinates of that prisoner. Example locations = [[1, 1], [1, 2], (2, 1)] [4. 4), (4, 6], [9. 4). [98]]
Round 2: Interview
DSA questions