"""
Given a staircase where the ith step has a non-negative cost associated
with it given by cost[i], return the minimum cost of climbing to the top
of the staircase. You may climb one or two steps at a time and you may
start climbing from either the first or second step.

Ex: Given the following cost array...

cost = [5, 10, 20], return 10.

Ex: Given the following cost array...

cost = [1, 5, 10, 3, 7, 2], return 10.
"""

# TODO: incomplete
