Maximum Product Subarray, is a LeetCode problem from dynamic-programming subdomain. This problem has also been asked in companies like Linkedin 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 Maximum Product Subarray at LeetCode

Solution

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

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu