##
Subsequence with maximum odd sum
April 22, 2017

Given a set of integers, check whether there is a subsequence with odd sum and if yes, then finding the maximum odd sum. If no subsequence contains odd sum, return -1. Examples: Input : arr[] = {2, 5, -4, 3, -1}; Output : 9 The subsequence with maximum odd sum is 2, 5, 3 and… Read More »