In first round interviewer asked below question. 1. Given a mathematical expression as a string, evaluate it using the reverse BODMAS rule. Reverse BODMAS rule — that is, apply operations in the following order: Subtraction → Addition → Division → Multiplication Input : “3 + 2 * 4 - 1” output : 15 Input : “12 + 5 * 3 - 7” output : -68 2. Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Ex: Input: grid = [[1,3,1],[1,5,1],[4,2,1]] Output: 7
