30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 773. Sliding Puzzle

Given a 2x3 sliding puzzle with tiles 1–5 and a blank (0), find the minimum number of swaps of 0 with its 4-directional neighbors to reach the target [[1,2,3],[4,5,0]] (or return -1 if impossible). This is a shortest-path search in the permutation state graph (solvable via BFS/heuristic search due to the small state space).

Asked at:

Amazon

Microsoft

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late October, 2025

Microsoft

Mid-level

Late April, 2025

Amazon

Mid-level

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 773. Sliding Puzzle

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact