def uniquePaths(n, m): if (n == 1 or m == 1): return 1 else: return uniquePaths(n - 1, m) + uniquePaths(n, m - 1) print(uniquePaths(3, 3))
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter