Skip to content

Instantly share code, notes, and snippets.

@dlecocq

dlecocq/grid-paths.py

Created August 12, 2020 22:02
Show Gist options
  • Save dlecocq/9b7ef12b94ee018be97f6e5b52db7950 to your computer and use it in GitHub Desktop.
Save dlecocq/9b7ef12b94ee018be97f6e5b52db7950 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
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))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment