#Grid

Discuss a grid/graph problem that involves identifying and counting islands in a given representation. Describe your approach to solving it.

You have a grid of oranges where some are rotten and some are fresh. Every minute, any fresh orange that is adjacent to a rotten orange becomes rotten. Given the grid, return the minimum number of minutes that must elapse until no cell has a fresh orange. If it is impossible, return -1. Example: Input: grid = [[2,1,1],[1,1,0],[0,1,1]] Output: 4.

Determine the minimum cost path in a given grid where each cell has a cost. Provide the algorithm to find the path with the least cost from the top left to the bottom right of the grid.

Given a 2D grid representing land (1) and water (0), you need to connect all the islands together by converting the water (0) to land (1). Count the minimum number of 0s you will need to flip to connect all islands.