Min Cost Climbing Stairs, is a LeetCode problem from dynamic-programming subdomain. This problem has also been asked in companies like Amazon during the interview. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Min Cost Climbing Stairs at LeetCode


added to previous smallest sum, so the Bellman equation is

          dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i]

Time Complexity: O(n), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu