Subscribed it... Pahla video dekhne par hi subscribe kar liye... Bhai kitne patience ke sath padhate ho... Its just awesome/amazing...More power to u brother.
I am glad. Keep learning. Keep supporting. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@@jobanpreetsingh2370 I solved problems from leetcode. For concepts and difficult problems I used to watch TH-cam videos from different channels, pepcoding was also one of them. So, I prepared not completely but partly from pepcoding
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
its for when we have a subarray sum divisible by k for first contiguous elements starting from first element like example : 5 2 k = 7 for this answer should be 1 but if u do not add 0,1 initially you will get 0
Sir I have a question,what to do if I also need to print the subarrays as well?how to do it with this method. We are not able to add different indexes in hashmap for a single prefix sum/remainder
Can be done easily (but non-trivial) using vector or vector. For each remainder there is a set associated with it, which contains the starting index (L-1). So while iterating over calculating prefix sum, we also iterate over indices present for that remainder, where `i` would represent the ending indices, so just iterate and get the subaray. But using prefix sums for this approach seems rather too non-trivial and unnecessary, instead just iterate over the subarr with O(N^2). For the approach that I just gave, in the worst case, we would have to print out all the subarrays, which would mean this problem itself is O(N^2), I don't think this would be asked anywhere
The negative mod trick is main part to identify in this problem.. Thanks for explaining that 👍🏼
Sir you are a legend. You make everything look so easy.
Greatest explanation to this problem.
Found a leetcode daily buddy here lol!
your repititive explanation is so amazing sir😍😍
make things learned while watching the video🤩🤩🤩
Best possible explaination for this sum
a lotttt better than any other solutions on YT
Awesome 👍. Your explanation looks so good that I can code directly without any second thought. Thanks a lot bro 👏👍
Mazza aagya Waah kaafi time ke baad 2 videos dekhi hai ek saath !!!! Keep going
Thank you for simplified explanation!❤️
Just 1 min into the video, liked the way you are explaining. LIKED the video.
I just can not thank this guy enough :)
Subscribed it... Pahla video dekhne par hi subscribe kar liye... Bhai kitne patience ke sath padhate ho... Its just awesome/amazing...More power to u brother.
I am glad. Keep learning. Keep supporting. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot
Excellent Video, Great Explanation
What a simplified and well explained solution
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
You missed a case of if(rem==0) then also count++ becuse its the sum staring from first index and need to be checked seperately
I am very happy that I have discovered this channel, but sad also why not earlier, Anyways now i think my placements prep is going to be OP :)
You are placed?
@@jobanpreetsingh2370 yep
@@aisakyunhotahai8130 you prepared from Pepcoding?
@@jobanpreetsingh2370 I solved problems from leetcode.
For concepts and difficult problems I used to watch TH-cam videos from different channels, pepcoding was also one of them.
So, I prepared not completely but partly from pepcoding
@@aisakyunhotahai8130 If you don't mind, can you please tell us where you got placed?
This is nice. Got the intuition
Nice video keep on making such videos.
Superb! Explanation sir.
Great explanation ❤
Amazing explanation sir
sir garda uraa diye aap toh
Great Explanation sir!
Hello @pepcoding, can you please explain Leetcode 523? Its using HashMap but there is no good explaination.
simple python solution: def subarraysDivByK(self, nums: List[int], k: int) -> int:
reminder_freq = defaultdict(int)
reminder_freq[0] = 1
res = 0
prefixsum = 0
for n in nums:
prefixsum += n
reminder = prefixsum % k
res += reminder_freq[reminder]
reminder_freq[reminder] += 1
return res
Amazing explanation!
sumeet sir is a legend 🔥🔥🔥🔥
you're the best :)
You are awesome. Sir.
thank you so much
good explanation sir if possible try to provide c++ solution
Sir please pehle brute force solution discuss kra kro then optimal solution 🙏
It would be better if you could explain how you came to conclusion that the remainders should be equal .
He actually started the video with that
thanks sir the solution was easy to understand and great but it was not able to pass all the test cases for the same question on coding ninja 😿
ya bro
didn't explain about the combinations of mod groups, rest explanation was amazing.
I want to meet you in real life i just got a 7 lpa at rev thank you sir i have learnd a lot from you
Glad to know. Sure, I would love to. Please DM me on Instagram
Wow sir
Done!
why did you added 0,1 in the hashmap initially? Can you please explain that?
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
its for when we have a subarray sum divisible by k for first contiguous elements starting from first element
like example : 5 2
k = 7
for this answer should be 1 but if u do not add 0,1 initially you will get 0
#include
int subArrayCount(vector &arr, int k) {
map mpp;
mpp[0]=1;
int count=0,presum=0,rem=0;
for(int i=0;i
Mjja agaya sir
Beautiful.
Glad that you liked it.For better experience visit on nados.pepcoding.com
Don't forget to follow us on Instagram instagram.com/pepcoding/
but if zeroes is present create errror in that
line no. 9. -> should be map.put(0,-1) instead of map.put(0,1) isn't it? please confirm. thanks.
How are you drawing so fast? Using Mouse or a pencil?
Penboard
how do we develop the intuition for this kinda approaches
practice
by solving it beforehand hehehehehe
there is same kind of question find on leetcode
subarray sum k
subarray sum 0 gfg
subarray product k
subarray divisible by k
A case added when all element non zero if it contains zero ur code fails
Sir I have a question,what to do if I also need to print the subarrays as well?how to do it with this method. We are not able to add different indexes in hashmap for a single prefix sum/remainder
Can be done easily (but non-trivial) using vector or vector. For each remainder there is a set associated with it, which contains the starting index (L-1). So while iterating over calculating prefix sum, we also iterate over indices present for that remainder, where `i` would represent the ending indices, so just iterate and get the subaray. But using prefix sums for this approach seems rather too non-trivial and unnecessary, instead just iterate over the subarr with O(N^2). For the approach that I just gave, in the worst case, we would have to print out all the subarrays, which would mean this problem itself is O(N^2), I don't think this would be asked anywhere
Legend.
We are glad you liked it. For best experience visit on nados.pepcoding.com
let say if sum=-14 then also 7 add karenge ki 7 ka multiple becasue remainder positive bnana hai right??
Remainder =0, so no need to add 7 or its multiple
Nice
keep motivating, keep learning and keep loving Pepcoding😊
Why don't you take this in english?
us
i dont like the video explain in english
i don't like you. i will not.