Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Unique Paths III

Explore the backtracking technique to solve Unique Paths III by identifying start and end points in a grid, counting valid paths that visit every empty cell exactly once, and managing obstacles. Learn recursive path exploration and backtracking to efficiently count all unique routes.

We'll cover the following...

Statement

You are given a  m×nm \times n  integer array, grid, where each cell, grid[i][j], can have one of the following values:

  • 1 indicates the starting point. There is exactly one such square.

  • 2 marks the ending point. There is exactly one such square.

  • 0 represents empty squares that can be walked over.

  • -1 represents obstacles that cannot be crossed.

Your task is to return the total number of unique four-directional paths from the starting square (1) to the ending square (2), such that every empty square is visited ...