https://algorithm.liangqin.ren/tags/hamiltonian-path/Recent content in Hamiltonian Path on Algorithm SolutionsHugo -- gohugo.ioSat, 29 Aug 2026 15:39:15 -0500https://algorithm.liangqin.ren/leetcode/980/Sat, 29 Aug 2026 15:39:15 -0500https://algorithm.liangqin.ren/leetcode/980/1. Description You are given an m x n integer array grid where grid[i][j] could be: 1 representing the starting square. There is exactly one starting square. 2 representing the ending square. There is exactly one ending square. 0 representing empty squares we can walk over. -1 representing obstacles that we cannot walk over. Return the number of 4-directional walks from the starting square to the ending square, that walk over every non-obstacle square exactly once.