SDE - 2

Design a snake and ladder game. Code should be modular and demoable. He mentioned the code should handle cases when you want to add a new obstacle along with snake and ladder, add any number of players in the game etc.

Ninja got a map in his hand with ‘N’ cities numbered 0 to ‘N’, connected with bridges. He asks his sister to delete some cities from the map.

He will ask his sister a ‘Q’ query. Each query is denoted by an integer ‘X’, meaning that he will delete the city ‘X’. He wants to see if the new map obtained after deleting the city node will have more connected components than the previous map.

He wants to build the program for the queries given by his sister for the above condition.

Ninja knows that you are a very good programmer and can help him in writing the code for the above. Help Ninja!

Note:

A connected component in the map is the maximum subset of cities that are connected i.e we can go from one city to any other in that subset.

Given a 2-dimensional matrix of size ‘N’ x ‘M’. Find the size of the largest sub-matrix whose sum is equal to 0. The size of a matrix is the product of rows and columns in it.

A sub-matrix is a matrix obtained from the given matrix by deletion of several (possibly, zero or all) rows/columns from the beginning and several (possibly, zero or all) rows/columns from the end.

For example :

If there is no sub-matrix with sum equal to 0, then return 0.

Design a tiny url service, how many days will I need to come up with a production level code.
Why phonepe ?
Some behavioral questions.
Then I asked him a couple of questions about Phonepe.