dlecocq · August 12, 2020 22:02
diff --git a/grid-paths.py b/grid-paths.py
 from __future__ import print_function

 # Imagine we're on a grid as point `(x, y)`. If we can only move down or left, one grid
 # point at a time, how many unique paths can be made from `(x, y)` to the origin?

 def paths(x, y):
    # Your implementation here
    pass

 # As an example, this should be 56
 print(paths(3, 5))
	from __future__ import print_function

	# Imagine we're on a grid as point `(x, y)`. If we can only move down or left, one grid
	# point at a time, how many unique paths can be made from `(x, y)` to the origin?

	def paths(x, y):
	# Your implementation here
	pass

	# As an example, this should be 56
	print(paths(3, 5))