Draft
Maximum Product of Sub-Array
Description:
You are given an array of integers between -10 and 10
You must find the maximum product that can be calculated from a sub-array of the array you are given.
Just for fun, all imports are prohibited
Example:
array = [1,3,-7,8,4,-1,2,-5,3], maximum product is 1344, the product of [1,3,-7,8,4,-1,2]
array = [2,5,6,4], maximum product is 240, the product of [2,5,6,4], in this case the entire array
Tests:
- 100 short tests: Array length <= 20
- 100 medium tests: Array length <= 1,000
- 20 large tests: Array length <= 1,000,000
Arrays
Performance
Restricted
Similar Kata:
Stats:
| Created | Jun 23, 2024 |
| Warriors Trained | 6 |
| Total Skips | 0 |
| Total Code Submissions | 44 |
| Total Times Completed | 5 |
| Python Completions | 5 |
| Total Stars | 2 |
| % of votes with a positive feedback rating | 0% of 3 |
| Total "Very Satisfied" Votes | 0 |
| Total "Somewhat Satisfied" Votes | 0 |
| Total "Not Satisfied" Votes | 3 |
| Total Rank Assessments | 3 |
| Average Assessed Rank | 5 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 5 kyu |
