Shortest Path Grid

You are given a 2D grid represented as an m x n matrix of integers where each cell contains either a 0 or a 1. In this grid:

• 0 represents an empty cell where you can walk freely.
• 1 represents an obstacle that blocks your path.

Your goal is to find the minimum number of steps required to move from the top-left cell (0, 0) to the bottom-right cell (m-1, n-1). You are allowed to remove at most one obstacle (change one 1 to a 0) in order to create a valid path.

Rules and constraints:

1. You can move one step at a time in the four cardinal directions: up, down, left, and right.
2. You cannot move outside the boundaries of the grid.
3. If there is no possible path from the start to the finish even after removing one obstacle, return -1.

Implement a function or method that takes the grid as input and returns the minimum number of steps required to reach the destination, or -1 if it is not possible.

Consider edge cases such as a grid with no obstacles, a grid where the start or end position is blocked, and grids of varying sizes.

Good luck!