Jira Ticket: LND-52
LeetCode: https://leetcode.com/problems/maximum-product-subarray
Pattern: Sliding Window
Difficulty: Medium
Status: To Do
Priority: Medium
Labels: 1-D_Dynamic_Programming, Medium
Created: 2025-08-21
Last Updated: 2025-08-22
Problem URL: https://leetcode.com/problems/maximum-product-subarray Problem Description: Solve the Maximum Product Subarray coding problem according to the LeetCode description. Visit the problem URL for the complete description and examples. Difficulty: Medium Category: 1-D Dynamic Programming
- What are we asked to find/compute?
- What are the inputs and outputs?
- What are the edge cases?
Time Complexity: O(?)
Space Complexity: O(?)
Algorithm Steps: 1. 2. 3.
Time Complexity: O(?)
Space Complexity: O(?)
Example:
Step 1:
Step 2:
Step 3:
# Your solution here
def solution():
passInput:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
- When to use sliding window:
- When NOT to use this pattern:
- Pattern Guide
- LeetCode Discussion: https://leetcode.com/problems/maximum-product-subarray/discuss/
- Problem understood
- Pattern identified
- Brute force solution
- Optimized solution
- All test cases pass
- Complexity analyzed
- Code reviewed
- Learnings documented
- Jira ticket updated
Status: 🔴 Not Started
Last Updated: 2025-08-22