Maximum Sum of 3 Non-Overlapping Subarrays, 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 Maximum Sum of 3 Non-Overlapping Subarrays at LeetCode

Solution

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