Find The Maximum Subarray Sum ( LeetCode #53 ) | FREE DSA Course in JAVA | Lecture 75

Let's see a popular Leetcode question number 53. In this program we have to find the maximum subarray sum.
What does this mean?
Given an integer array nums, find the maximum contiguous subarray (containing at least one number) which has the largest sum and return the sum.
For eg. [1, -2, 3, 4] is the array then the answer will be [3,4] and the output will be 7.
Now as we always do in all our lectures. Let's understand a naive approach.
We already know how to find the subarrays of a given array.
Hence we can find the sum of all subarrays and can return the maximum sum.
This approach will surely work but it's not efficient.
Let's see in this lecture how we can find a more efficient approach to solving this program.
For more information, fill out this form: forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacademy.com​
#java #array #programming #programmer #coding #dsa #placement #job #itjobs

[@Tchknow879]

thanku sir for simple explanation

[@rupeshpatil6957]

Thanks a lot Sir

[@kiranmaik7128]

Thank you so much for the Topic understood the Concept in a ease

[@KRajesh-ej7dy]

Rohit sir after listening to your logic no need to see the code we can write it ourselves.Thanks soo much for beautiful explination.

[@TAPACADEMY]

That's great. We are trying to deliver you the best content. Do subscribe and share the channel.

[@GautamiPinkyar]

Thankyou so much. The explanation was superb

[@powerofwisdomstories]

Thank you bhaiya😃😃

[@pradeepkumar-em5re]

Your video on DSA in Java was truly exceptional! Your clear and concise explanations, coupled with visually appealing graphics, made learning complex algorithms a breeze. You are a master of your craft, and it was a pleasure to watch.

[@TAPACADEMY]

Glad you liked it! Please share it to your community.

[@informer3268]

i dont know some miracle happend i understood this problem very easily

[@anushkatupe9502]

GOAT❤❤❤

[@asifrahman2155]

what a teaching style ... love form bangladesh

[@deyoz1]

Hahaha the best video I found for this max subarray peoblem.

[@dharanidaran.s9063]

W explanation

[@hari7110]

Sir, your teaching is just wow wow wow

[@situationinsights2957]

I tried to watch so many videos but nobody explain better then you thanks alot sir i subscribed you

[@shubh054]

What if len(arr) == 1. For ex: if I have 1 element in arr, i.e [1] then the maxSum would be 2 (sum = sum+arr[i]). We need to cover this case as well

[@SriAnjineyudufh-]

Good explanation sir

[@TAPACADEMY]

Keep watching and do share our channel in your community.

[@abdihaashin1350]

i love you man. nobody will explain the way you explain

[@anirutthsa6237]

Hands off 🎉🎉🎉 sir , no words to describe your level of teaching 🎉🎉🎉🎉

[@Lucifer-jl9vh]

Excellent explanation sir

[@namratasingh711]

You made DSA easy to understand. Excellent video!

[@K_Ceesh]

God complex teaching skills , MAD RESPECT 🙏

[@karanhaldar755]

thnaks for the help
@TAP ACADEMY
actully i learn lot of topics from your channnel
but here u should take -> sum value as (0),, other wise it will add sum's value with max_sum's value and give the wrong answer

[@saarza9991]

Thanks

[@jasper5016]

You are fantastic. It could have never been easy. Thanks so much.

[@hatredguy]

Amazing explanation!!! SUBSCRIBED!!!!

[@DSApotd]

Awesome ! explanation sir

[@divypareek8230]

Sir your teaching speed resonates with my interpreting speed

[@sairamthimmisetty1583]

I loved the way, he is explaining. A unique way of teaching, which is more understandable. Thank you, sir.

[@namratasingh711]

Superb ..Unique way of teaching 👏👏

[@mdanwaralam8873]

thank you so much sir,you are explaining very well

[@yaswanthreddy2623]

what a explanation sir. Easiest one.

[@RabiyaBasri-qy4lb]

wow such a great explanation

[@moodswingsoflife]

Such a good explanation

[@shivamgupta-yz6pc]

thank you soo much sir❤

[@twishanuaichroy1938]

Very very good explanation

[@kavitadurge3384]

Hats off, I have become fan of you teaching bro 🙏

[@computer_tech98]

The best sir to teach the coding and to understand it
Thank you sir

[@ABDULKALAM-ig2dd]

Nice clear explanation ❤

[@RS-vu5um]

Excellent explanation

[@sarthikbangroo6097]

Sir Your Explanation is WOW Thankyou so much Sir ❤

[@charizard782]

Wonderful session sir ..
Thanks soo much ..

[@TAPACADEMY]

Always welcome. Do subscribe to the channel.

[@balusekhar]

Thank you is all I can say

[@kenwaybinks4223]

Watched many videos to understand the intuition behind it........but this is by far the best explanation for kadane's algo....rohit sir🤙🔥

[@sonalikumari2522]

thanku sir you solve my dry run problem very well:)

[@jonu.1504]

You got subscriber. Thanks.

[@user-zf7hq4yk4c]

coolest Explanation ever!!period
\

[@mk6263]

Sir plz continue the lectures sir humble request🙏

[@LalitSharma-vo2dr]

209. Minimum Size Subarray Sum please make video on this leet code question

[@Naya_Gyan7]

Nice explanation sir 🎉❤❤

[@afreedpasha7949]

Sir I have no words to put up you are just amazing and I'll start watching the whole series from beginning, maza aagaya dekh k so curious to watch this playlist from beginning though I know most of the concepts. Amazing delivery of the content!!!

[@Nshupriya]

loved ur level of teaching ... very well explained sir 😁😁

[@firoz2175]

Superb sir❤

[@kidoo1567]

The best video ever seen

[@srishtisuman4919]

Sir ur way of explanation is very easy to understand .

[@TAPACADEMY]

Thanks and welcome. Subscribe to the channel for regular tips.

[@spacelovertelugu44spacelov46]

OMG you are genius man

[@BeingShortlyApt]

How are you inside the computer😭

[@ignitealex8107]

Best explanation sirr ❤ well said about Gujaratis 🥂😎

[@BOSS55]

Beautiful masterful glorious ❤❤

[@ranurautray508]

sir please upload questions on substring and hashmap

[@charizard782]

Sir please update the next videos .
You have not applied the videos from 2 days .

[@TAPACADEMY]

There was some problem. From today we will upload lectures again and will cover two lectures per day to cover up the missed classes.

[@Sabh00]

Thank you so much sir for your beautiful teaching style

[@STFK101]

hi im plusone student usefull videos thanks bro

[@TAPACADEMY]

Happy to help

[@Sabh00]

Now waiting for majority element

[@VirajGund-yu1vl]

sir you are not uploading videos in last 2 days why

[@TAPACADEMY]

There was some problem. From today we will upload lectures again and will cover two lectures per day to cover up the missed classes.

[@mk6263]

Sir plz explain max triplet sum sir

[@ukgaming06]

❤

[@moonlight_350]

class Solution {
public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
if(nums.length == 1){
return nums[0];
}
int sum = nums[0];
int maxSum = nums[0];
for(int i=1;i= 0){
sum += nums[i];
}else{
sum = nums[i];
}
if(sum > maxSum){
maxSum = sum;
}
}
return maxSum;
}
}