1st problem Problem Statement You are given an array sequenceData of n positive integers. You may perform the following operation any number of times (including zero): Choose a prefix of length s (1 ≤ s ≤ n) that contains no zeros. Subtract 1 from each element in that prefix. After performing operations in any order, determine the maximum number of zeros that can appear in the array. 2nd problem You are given two strings: sourceString: the original string in which you need to search. pattern: a simplified regex-like pattern that contains exactly one asterisk '*'. The '*' can match any (possibly empty) substring of sourceString. Your task is to find the length of the longest possible substring in sourceString that: Starts with the prefix before the '*' in pattern, and Ends with the suffix after the '*' in pattern, And the prefix and suffix do not overlap unless the '*' can represent the in-between part (or nothing at all). If no such match exists, return -1.