Fix Nov 25

Author: siddydutta

2024-11-November-LeetCoding-Challenge/Sliding Puzzle.py

@@ -24,8 +24,7 @@ def slidingPuzzle(self, board: List[List[int]]) -> int:
                 return steps
             for neighbor in neighbors[zero]:
                 new_state = list(state)
-                new_state[zero] = new_state[neighbor]
-                new_state[neighbor] = new_state[zero]
+                new_state[zero], new_state[neighbor] = new_state[neighbor], new_state[zero]
                 new_state = ''.join(new_state)
                 if new_state not in visited:
                     visited.add(new_state)