TWC 97 - Dynamic programming - Largest Sum Contiguous Subarray using Kadane's Algorithm in Tamil

Problem Description: Given an array arr[] of size N. The task is to find the sum of the contiguous subarray within a arr[] with the largest sum? Input: [-3, -4, 5, -1, 2, -4, 6, -1]Output: 8Explanation: Subarray [5, -1, 2, -4, 6] is the max sum contiguous subarray with sum 8. Input: [-2, 3, -1, 2] Output: 4 Explanation: Subarray [3, -1, 2] is the max sum contiguous subarray with sum 4. Join our TEQ Weekly Coding Group and share your comments. If you want any programs to be solved. Update us in that Group. Join us : Contact: Ismail NS, 88830 76220 T4TEQ Software Solutions is one of the top training companies in Tamilnadu, India. We have planned to put weekly interview programs. Like the video Comment on the video Subscribe for more videos Are you planning to do an online course? Are you planning to do career development courses? Are you stepping into college? Here we are, T4TEQ Software solutions, Trichy We are ready to support you... Facebook : https://www.facebook.com/LearnatT4TEQ/ Instagram : https://www.instagram.com/learnatt4teq/