Company: ZOMATO

Minimum Time to Complete Tasks with Dependencies

You are given N tasks numbered from 0 to N-1. Each task takes 1 unit of time to complete. Some tasks depend on the completion of other tasks and can only start once all their prerequisite tasks are finished. You are given a list of dependency pairs (a, b), meaning task a must be completed before task b can start.

You have unlimited resources a nd can run multiple tasks in parallel as long as their dependencies are satisfied. Your task is to find the minimum time required to complete all tasks.

Function Description:
Implement the function minimumTimeToCompleteTasks with parameters:
- N: integer, total number of tasks
- M: integer, number of dependency pairs
- dependencies: list of pairs (a, b) where task a must be completed before task b

Return:
- int: minimum time to complete all tasks

Constraints:
- 1 ≤ N ≤ 10^5
- 0 ≤ M ≤ 10^5
- 0 ≤ a, b < N

Sample Input:
5 4
0 1
1 2
0 3
3 4

Sample Output:
3

Explanation:
- Task 0 starts at time 1
- Tasks 1 and 3 depend on task 0, so they start at time 2
- Task 2 depends on 1, and task 4 depends on 3, so they start at time 3
Thus, the minimum time to complete all tasks is 3. Show More

Rotten Oranges

You are given an N x M grid representing a storage area for oranges. Each cell in the grid can be:
- 0: empty cell
- 1: fresh orange
- 2: rotten orange

A rotten orange at position (i, j) spreads rot to its adjacent fresh oranges (up, down, left, right) every minute. The rotting process happens simultaneously for all rotten oranges at each time step.

Your task i s to determine the minimum time required for all fresh oranges to become rotten. If at least one fresh orange cannot rot, return -1.

Function Description:
Implement the function minTimeToRottenOranges with parameters:
- int N: number of rows in the grid
- int M: number of columns in the grid
- int[][] grid: a 2D array representing the orange states

Returns:
- int: minimum minutes for all fresh oranges to rot, or -1 if impossible. Show More