Intuit SDE Interview Question 2024 November | Graphs & BFS | on-campus

Question 1: Sliding Puzzle Problem Statement On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and swapping it with an adjacent number (horizontally or vertically). The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]]. Given the puzzle board board, return the absolute least number of moves required so that the state of the board is ...