1 technical round.

Asked 2 DSA questions:

1. Given an array arr[] of integers, find out the maximum difference between any two elements such that the larger element appears after the smaller number.

2. Given a matrix of dimension M * N, where each cell in the matrix can have values 0, 1, or 2, which has the following meaning:

   • 0: Empty cell
   • 1: Cells have fresh oranges
   • 2: Cells have rotten oranges

The task is to find the minimum time required so that all the oranges become rotten. A rotten orange at index (i,j) can rot other fresh oranges which are its neighbors (up, down, left, and right). If it is impossible to rot every orange, then simply return -1.

A little bit of DSA theory along with the two questions.