Question

Even Subarray A subarray is a contiguous portion of an array. Given an array of integers, determine the number of distinct subarrays that can be formed having at most a given number of odd elements Two subarrays are distinct if they differ at even one position their contents. For example, if numbers [1, 2, 3, 4] and the maximum number of odd elements allowed, k 1, the following is a list of the 8 distinct valid subarrays: [[1], [21, [3], [4], [1,2], [2, 31, [3, 4], [2, :

Answer 1

def countSubarrays(ar,mcnt): count=0 n=len(a) for m in range(mcnt+1): prefix = [0] * n odd = 0 # traverse in the array for i in range(n): prefix[odd] += 1 # if array element is odd if (a[i] & 1): odd += 1 # when number of odd elements>=M if (odd >=m): count += prefix[odd - m] return count # Driver Code a = [1,2,3,4] n = len(a) m = 1 print(countSubarrays(a,m))

ON 1. def countSubarrays(ar, ment): 2. count=0 3. n=len(a) for m in range(mcnt+1): 5. prefix = [0] *n 6. odd = 0 7. # traverse in the array 8. for i in range(n): prefix[odd] += 1 10. # if array element is odd 11. if (a[i] & 1): 12. odd += 1 13. # when number of odd elements >=M 14. if (odd >=m): 15. count += prefix[odd - m] 16. return count 17. 18. # Driver Code 19. [1,2,3,4] 20. len(a) 21. m = 1 22. 23. print(countSubarrays(a,m)) 24. 25. a = n = Success #stdin #stdout 0.02s 9040KB comments (0) copy stdin Standard input is empty stdout © copy 8