Subarray with given Sum | Python Code

[@sanjaybalaji6506]

Pls post videos daily you are the best explainer I have ever seen.

[@Ajay-rq4wd]

Good explanation all the best

[@francescojamesfanti6430]

i was given a practice exercise at university were i should count in how many ways i can form a subarray that does the given sum. I have to do it in an efficient way and that seems the right way, but i cannot count right. (the array has zeroes and positive integers)

[@shilpagopal6937]

Tqs for this video.... U were my savior....

[@nETSETOStECH]

Welcome 😀

[@yaminikoneti5091]

i have a doubt, the dictionary cannot have same keys, so here for index0 the sum is 10 and and we are storing as the key, also the index 3 we have sum 10 that is being stored as key.

[@touheedfathima8923]

def subarray_sum(arr,sum): dict1={} curr_sum=0 for i in range(len(arr)): curr_sum=curr_sum+arr[i] if curr_sum == sum: print("Subarray starts from 0 to ",i) return if curr_sum-sum in dict1: print("subarray starts from ",dict1[curr_sum-sum]+1,"to",i) return dict1[curr_sum]=i print("no subarray found") arr=[1,4,20,3,10,5] sum=33 subarray_sum(arr,sum)

[@pritammishra9850]

Grreatly beneficial

[@nETSETOStECH]

Thank you!

[@canopus3310]

love your explanation❤

[@jeevapriya4853]

Mam plz make videos on data structures graphs like topological sort nd those similar kind algo's

[@nETSETOStECH]

Yes. I will Upload soon

[@jeevapriya4853]

Tq u mam

[@sreelekshmiajaykumar3297]

So the line 10's print statement prints the value in the dictionary right?

[@pritammishra9850]

Can you please make a video on finding kth largest element in an array...I'm getting confusee

[@pratheeeeeesh4839]

Use quick select algo!

[@practicalbong1497]

you are great

[@Knowledgeon541]

[@Prat-zi1ou]

Use 1.5 x

[@ChandanKumar-em8zg]

2