Description Submission class Solution {public:int maxProduct(vector& nums) {if(nums.empty()) return 0;int localMin = nums[0], localMax = nums[0], globalMax = nums[0]; }; References https://medium.com/@aliasav/algorithms-maximum-product-subarray-b09e520b4baf https://www.wikiwand.com/en/Maximum_subarray_problem https://leetcode.com/problems/maximum-product-subarray/discuss/841167/C%2B%2B-Super-Simple-and-Clean-Solution-O(n) https://www.geeksforgeeks.org/maximum-product-subarray/
74. Search a 2D Matrix
Description Submission class Solution {public:bool searchMatrix(vector>& matrix, int target) {if(matrix.empty()) return false;if(matrix[0].empty()) return false; };