The interview process consisted of two rounds:

• An Online Assessment on HackerRank, which included two questions.
• An Interview Round, where two DSA questions were asked.

In the interview, I was asked to introduce myself, and they immediately proceeded to the questions.

Q1: Given an m x n grid filled with non-negative numbers, find a path from the top left to the bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time.

Q2: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that, together with the x-axis, form a container such that the container contains the most water. Return the maximum amount of water a container can store.