Mam actually i dont know kadan algorithm .Is this is the only way to solve this problem or can u please guide me how to proceed with the question.
Can u please tell how to proceed with!
This Question can be done using the brute force viz, by using two nested loops and checking the sum of every possible subset but this approach is in O(n^2)