SDET-2

You have been given a matrix of ‘N’ rows and ‘M’ columns filled up with integers. Find the minimum sum that can be obtained from a path which from cell (x,y) and ends at the top left corner (1,1).

From any cell in a row, we can move to the right, down or the down right diagonal cell. So from a particular cell (row, col), we can move to the following three cells:

Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)

Explain on Data warehousing?
Monitoring tools you have worked with
Escalations and delivery in previos projects

Technical round with project VP.
One data structure question on array sorting with increase in complexity as per answer. 
How to deploy a webiste on AWS using EC2 and S3?
Azure traffic distribution

Scenario based questions on behavourial assessment.
what would you do in case of a production issue ?
How to escalate an issue to hier management?

What was your previous copensation?