Find if there is any subarray with sum equal to 0 | Q21 | Love Babbar DSA Sheet | Leetcode | Amazon

preview_player
Показать описание
#competitiveprogramming #dsasheet #interviewpreparation

In this video I have solved the 21th problem of the sheet.

Hope you like it. Comment if you have any doubt.

LIKE | SHARE | SUBSCRIBE
Рекомендации по теме
Комментарии
Автор

Please upload all questions, every ques difficulty veries from person to person so an easy ques for a person might be diificult for some other.

bitrish
Автор

Only Important questions.

*A suggested strategy* :
For every 5 questions, you can choose to select the tougher 3 questions.

So out of 450 questions, you will have to do 270 questions.
I would request you to solve 3 questions per day then it would get completed in 3 months, which is a decent time frame for students preparing for their placements or for their internship interviews.

In this way, medium and harder-level questions would already get solved.

By that time, the subscribers would increase by manifolds. So the 1st year and 2nd year students or say the newbies would also come to know about this channel from their seniors. Then you can do the rest of the questions which would be mostly comparatively easy questions and medium level questions, which would not only keep the newbies interested but it would also bring in more new subscribers.

Thank you for this brave and generous initiative.

Another suggestion: After a month you can even activate the JOIN button, which would keep you motivated as well.

souvik
Автор

All questions buddy
Your teaching skill is amazing

abhishekgupta
Автор

all the questions, because if some one is getting started will get a grate help from yours video .

himanshukumar-kxqq
Автор

All questions boss, All will grow together 👍
Your teaching skill is amazing, @Abhishek gupta is telling right

kapildubey
Автор

All questions of course. Sometimes even so-called 'Easy' questions are tricky and have a lot of content in them to learn from!

suvigyabasnotra
Автор

thank you yogesh it is really helping us

ramgopalkashyap
Автор

Literally sirji very great explanation, now the question is looking like a piece of cake thanks

akashkumaryadav
Автор

you are doing a gd work, pls try to upload all these que.

azharbeg
Автор

Best explanation..

I was scratching my head since days to understand the third logic of zero..

Respect💪💪

mishra
Автор

thank you bhaiya pura youtube dekh liya lastme apse hi smjh hi aya

rahulbishnoi
Автор

All questions 👍.
But daily 2 to 3 questions.👍👍
If questions easy then only gives approach to how to do . And for imp or little tricky then make the video on that questions.

jayeshyadav
Автор

Finally found someone who actually explain the concept very well brother

sahilbisht
Автор

i cant thanks enough,
bhai you are doing a great job
bas yehi request plz dont stop in between.
chahe koi dekhe ya na dekhe, i will be your regular viewer and i gurantee you

danishranjan
Автор

#include<bits/stdc++.h>
int countSubarrays(int n, vector<int> &arr)
{
int s=0;
int ctr=0;
unordered_map<int, int> m;
m[0]=1;
for(int i=0;i<n;i++)
{
s+=arr[i];
if(arr[i]==0 || s==0 || m[s])
{
ctr++;
}
else
{
m[s]=1;
}
}

return ctr;
}

Only one test case is correct

kshitijgupta
Автор

Make video on print all subarray with sum 0

ankushverma
Автор

how to delete driver codes in gkg i am unable to this same code due to driver codes

gagandeepsinghmakkar
Автор

please cover all questions...im in 2nd year

saumyajaiswal
Автор

upload all questions n also upload code in java

vishalmishra
Автор

Excellent explanation brother thank you.

dpxy
visit shbcf.ru