leetle

Daily challenge for 2025-02-27

58. Unique Paths

Write a function solve that returns the number of unique paths if the grid has obstacles (1 means blocked).

Example:
Input: [[0,0,0],
[0,1,0],
[0,0,0]]

Output: 2

Run this challenge interactively in Python or JavaScript when the app loads.