Round 1:
2 dsa
2 sql
1 oops
Dsa1 - check for binary tree is symmetric or not
Dsa2 - given an array, make a number by concatenating the array numbers.
Oops - polymorphism
Sql - 1 easy 1 tough query
Round2:
1 dsa question
Given a matrix of stations x trains. Matrix = 1 represent train start from that station and another 1 means train ends at that stations. Stations are linear. Find the path from source to destination with minimum train changes
Another question:
Rest and UI api are updating a database. Rest api erroneously considers primary id as string and append 1 to it while UI api normally increments the ID.
Rectify the rest api errors.
Round3:
Some common questions:
Check if solved sudoku is valid in one traversal (can visit one cell only once)
Sukdo solving without backtracking
Given a date, and number of days; find the next date after adding number of days…
Round4:
HR (chill)