We want to find the maximum sum of subarray…. For inital value we are setting-inf and for every sub array we calculate the sum and compare it with max sum if the current sum is grater we update max sum … This logic is similar to how we find largest element in an array
Namma channel la C programming full video l mention panirupom Turbo C++ pathi…. Athu use panratha mostly avoid panna panrathu nallathu aana college la panna sonnanha na paninga 😅😅
Hi bro, my question to you is, after learning data structures and algorithms, when we read a question, how will we know which algorithm or data structure to use to solve th problem?
@gurubalaguru8465 ethachu doubts na kelunga bro kandippa mudinja help ah panren comments la reply panna late aachu na goms.io instagram page la text pannunga bro
