You are given an m×n grid where 0 = empty, 1 = fresh orange, 2 = rotten orange. Each minute, any fresh orange adjacent (4-directionally) to a rotten orange becomes rotten. Return the minimum minutes until no fresh orange remains, or -1 if impossible.
grid = [[2,1,1],[1,1,0],[0,1,1]]4grid = [[0,2]]0grid = [[2,1,1],[0,1,1],[1,0,1]]-1