Find an index i such the a [ i ] is odd and compare Length of both halfs excluding a [ i ] to find max Length subarray
for i in range ( n ) : NEW_LINE INDENT if ( a [ i ] % 2 == 1 ) : NEW_LINE INDENT Len = max ( Len , max ( n - i - 1 , i ) ) NEW_LINE DEDENT DEDENT return Len NEW_LINE