1. You are given an m x n grid where each cell can have one of three values:
0 representing an empty cell,
1 representing a fresh orange, or
2 representing a rotten orange.
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1.
2. Given an array of integers where each element represents the max number of steps that can be made forward from that element.
Write a function to return the minimum number of jumps to reach the end of the array (starting from the first element).
If an element is 0, they cannot move through that element. If the end isn’t reachable, return -1.
Input: arr[] = {1, 3, 5, 4, 0, 2, 6, 7, 6, 8, 9}
Output: 3 (1-> 3 -> 9 -> 9)