Question

You are given an array of n integers, you have to find the number of ways you can select two non-overlapping subarrays from this array such that sum of each of subarray is divisible by 2.Gfg

Answer 1

$\mathfrak{The\:Answer\:is}$

You are given an array of n integers, you have to find the number of ways you can select two non-overlapping subarrays from this array such that sum of each of subarray is divisible by 2.Gfg.

$\boxed{Hope\:This\:Helps}$