Grid Navigation with Obstacle Removal

You are given an m × n integer matrix called grid, where each cell contains either 0 (representing a passable empty cell) or 1 (representing a blocked obstacle). Your goal is to navigate from the top-left corner at position (0, 0) to the bottom-right corner at position (m - 1, n - 1).

You can move in four cardinal directions: up, down, left, or right. Each movement to an adjacent cell constitutes one step. You may only move into cells within the grid boundaries.

Here's the twist: you possess the ability to remove obstacles. You are given an integer removalLimit which represents the maximum number of obstacles you are allowed to eliminate during your traversal. When you remove an obstacle, that cell becomes passable, and you can move through it.

Your task is to determine the minimum number of steps required to reach the destination, utilizing at most removalLimit obstacle removals. If there is no valid path that can reach the destination even after using all available obstacle removals, return -1.

Key Observations:

• The starting cell (0, 0) and the destination cell (m - 1, n - 1) are guaranteed to be empty (value 0).
• You must find the shortest path in terms of total steps taken, not the path that uses the fewest obstacle removals.
• Using fewer obstacle removals than the limit is perfectly acceptable if it yields the shortest path.