Yodlee Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

The round was technical round and it was held on google meet around 1 pm

Q1. 
Maximum Sum Rectangle Problem
Given an M x N matrix of integers ARR, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
Input:
The first line of input co...read more
Ans. 
Find the rectangle with the maximum sum of elements in a given matrix.
• Iterate through all possible rectangles within the matrix and calculate the sum of each rectangle.

• Keep track of the maximum sum encountered so far.

• Optimize the solution by using Kadane's algorithm for 1D array to find the maximum sum subarray in each row.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was managerial round and took place around 3 pm

Q1. 
Infix to Postfix Conversion
You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
Explanation:
An i...read more
Ans. 
Convert infix expression to postfix expression.
• Use a stack to keep track of operators and operands.

• Follow the rules of precedence for operators.

• Handle parentheses by pushing them onto the stack.

• Pop operators from the stack based on precedence.

• Append operands and operators to the postfix expression.
Answered by AI
Add your answer