Leetcode Problem 1263. Minimum Moves to Move a Box to Their Target Location

1263. Minimum Moves to Move a Box to Their Target Location

Leetcode Solutions

BFS within BFS Approach

  1. Initialize a queue for the BFS process and a visited set to keep track of visited states.
  2. Find the initial positions of the box, the storekeeper, and the target.
  3. Enqueue the initial state (box position and storekeeper position) with a push count of 0.
  4. While the queue is not empty: a. Dequeue the current state. b. If the box is at the target position, return the push count. c. For each possible direction (up, down, left, right): i. Calculate the new position of the storekeeper and the box if pushed. ii. Check if the new positions are valid (not a wall and within bounds). iii. Perform a second BFS to check if the storekeeper can reach the new position to push the box. iv. If the storekeeper can reach and the box can be pushed, enqueue the new state with the incremented push count.
  5. If no solution is found, return -1.
UML Thumbnail

A* Search Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...