There are 2 online coding rounds along were there. The first online round has some questions related to pseudo-code also. The second online round has questions related to CN, DBMS, and OS also along with 2 coding questions.
Round 1: Interview
- Given a matrix n*m initially having 0. You keep assigning 1 to given coordinates find no of connected components.
- Given a vector of coordinates.
- I started by giving a DFS based approach which I optimized by using a map such that for every new coordinate we check if any of its adjacent elements is already present then do not increase the count otherwise increase the count.
- Find a minimum no of transactions to settle a debt.
- https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/amp/
Verdict: Rejected