Leetcode 1263. Minimum Moves to Move a Box to Their Target Location
Given a grid with one player S, one box B, and one target T, find the minimum number of pushes (player moving into the box to move it one cell) to get B to T, where the player can walk on empty cells but cannot pass through the box. This is a shortest-path search in the state space of (box position, player position), requiring checks of player reachability to valid push positions; return -1 if unreachable.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late June, 2025
Junior
A storekeeper is a game in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an m x n grid of characters grid where each element is a wall, floor, or box. Your task is to move the box 'B' to the target position 'T' under the following rules: The character 'S' represents the player. The player can move up, down, left, right in grid if it is a floor (empty cell). The character '.' represents the floor which means a free cell to walk. The character '#' represents the wall which means an obstacle (impossible to walk there). There is only one box 'B' and one target cell 'T' in the grid. The box can be moved to an adjacent free cell by standing next to the box and then moving in the direction of the box. This is a push. The player cannot walk through the box. Return the minimum number of pushes to move the box to the target. If there is no way to reach the target, return -1.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.