Best Time to Buy and Sell Stock IV, is a LeetCode problem from dynamic-programming subdomain. 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 Best Time to Buy and Sell Stock IV at LeetCode


make a global and local dynamic array to find the biggest value

Note: when k >= n, dynamic programming is not efficient,

     we can take advantage of the method in Best Time Buy Sell Stock II

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

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu