Wells Fargo | OA | WarehouseBot Minimum Moves | Grid BFS & Shortest Path

Question: WarehouseBot Minimum Moves Problem Statement: In a grid representing a warehouse floor, each cell is either clear (0) or blocked by a storage rack (1). WarehouseBot must navigate from cell (0, 0) to cell (n-1, m-1) with a boost parameter b, allowing these moves: Right: (i, j) -> (i, j+x) where 1 <= x <= b Down: (i, j) -> (i+x, j) where 1 <= x <= b Left: (i, j) -> (i, j-x) where 1 <= x <= ...