@@hanovarghese9411 It's a website for learning a lot of skills. Like programming languages, Databases, Cyber security and a lot of things.
@NeelakshiSachdeva
4 ай бұрын
@@hanovarghese9411 Geeks for geeks
@zk6ss
3 ай бұрын
Geeks for Geeks
@HarshSharma-ib8ft
2 жыл бұрын
Day 43 Find Duplicates In An Array Every day, you strengthen and become even more perfect. Your explanations are always accurate and simple to grasp. I appreciate all of the help you have given over the months. Your support is very helpful. Your commitment and teaching skills are outstanding. It was an excellent learning experience that I have so far greatly enjoyed. I appreciate your ongoing support from the beginning. Good luck in the future and keep up the fantastic work. I look forward to getting to know you and spending valuable time with you while learning from you. You are my inspiration and I admire you a lot. You are the best, Nishant Bhaiya!
@prakharchakravarty9471
Жыл бұрын
Doubt:--Why are we returning index..shoudn't we return (arr[i]-2n)??
@codingforme
Жыл бұрын
this should be the case..coz they want the elements...but you get an error if u put (arr[i]-2n)...strangely it runs if u put i...sometimes u modify ur correct ans to a wrong ans to fit a wrong question :)
@vikasbagri1225
2 жыл бұрын
I literally got goosebumps when I see this approach. Hats off to those who come up with these ingenious ideas And one suggestion is if possible try this problem MAXIMUM OF ALL SUBARRAYS OF SIZE K as the intuition behind the optimized version of this problem is also amazing and I think we all will like it
@ayushyadav1894
Жыл бұрын
Yes it's greatful to learn you can enroll Nishant AlgoPrep DSA program for better understanding.
@Pika-pw4jc
Жыл бұрын
why are we pushing i in ans vector instead of arr[i]?
@snehagupta6737
Ай бұрын
did u get ans for ur ques?
@apoorvadubey2993
2 жыл бұрын
Thank you for teaching us these approach to the type problems in such a simplified way.
@ayushyadav1894
Жыл бұрын
Yes it's greatful to learn in simple way, you can enroll Nishant AlgoPrep DSA program for better understanding.
@justdoingodswork
Жыл бұрын
But what if all numbers is different like {4,6, 28, 4, 6} is it possible?
@WaniTech
Жыл бұрын
This method is working but this method is not ideal according to c++ standards, lets say we have array size of 5 and in that array there is an element 13, so if i calculate the index i.e index = arr[i]; // a[i] is 13 a[index] = arr[i]%n; // a[13] = 13%5; we are accessing 13th element which is out of the range of array and it is working because of the undefined behaviour of C++, it will work for small numbers, if i try to access a large number lets say arr[4000] = 80; it will give me the segmentation fault... This can cause a major bug in a software. by the way you are doing great :-)
@dipesh3395
Жыл бұрын
I got the same doubt.. Ig the method only works if the maximum element of the array
@nikhilkurrey9007
Жыл бұрын
@@dipesh3395 because the restriction of question is the elemets range is [1,n-1 ] then only it works
@AmanSingh-mw3iw
6 ай бұрын
Why are you doing redundant %n if all elements are already 0
@amritatiwary.
5 ай бұрын
I recommend you , Dry run krke dekho , Then you will realise
@preethig6601
2 жыл бұрын
Bro in Microsoft what role u are working like web developer or app and whether u work in websites or in what
@AbhishekPandey-yl3bp
Жыл бұрын
I think even if the question says that array has only one duplicate elements,you still can't use hare and tortoise method because array contains 0.
@yashaggarwal6013
10 ай бұрын
but what if range is from 0 to N and not N-1 like in the leetcode question number 442?
@sumitkanth5349
2 жыл бұрын
Day 43 me - programming muje smj rhi h, thanks bhaiya :)
@pooja2254
2 жыл бұрын
Thanku for the wonderful explanation
@shivdixit2587
2 жыл бұрын
Week 7 is abt to start. Never felt like it had came such a long way and I could follow it up everyday this long. 😂 Really consistency op😎😎😎 Thanks bhaiya 😊 Shiv
@onthego22
Жыл бұрын
poor approach. It can be done in 1 loop as well.
@nishthaarora1907
11 ай бұрын
public int findDuplicate(int[] nums) { int n = nums.length; int[] ans = new int[n]; for(int ele:nums) { ans[ele]+=n; if(ans[ele]/n>=2) { return ele; } } return -1; } why we are looping over the array twice ? isn't mentioned above is the precise soln?
@akashade7996
Жыл бұрын
Nice to explanation is clear doubt from this video thank you for making this video and this type of video is need to the audience so thank you 🎉❤❤
@vishalshrivastav1710
2 жыл бұрын
Thanks for the video bhaiya well explained......... :)
@manemanoj3068
2 жыл бұрын
Mast Bhai pora samaj aa gaya...❤️Hyderabad...
@tishagupta4540
2 жыл бұрын
Nishant Bhaiya giveaway ka result kab aayga...eagerly waiting for Microsoft tour 💙
@yashikagarg4044
2 жыл бұрын
Great explanation ❤️❤️
@NeelsArts
11 ай бұрын
Look at 4:42 suppose we have an array element 10 then 10%n(10%5) is 5......how do you get that 5th index in the areay
@deepanshu_the_vlogger
7 ай бұрын
In Question it is given that if array size in 5 then element should be in range from (1-5).
@rajgopalmutnali1127
9 ай бұрын
but what if array has element that is greater than size of array?
@sakshiawadhiya7267
2 жыл бұрын
Jo questions most repeated ho companies me arrays ke wo bhi karwa digieye
@shubhamkumarsingh8818
Жыл бұрын
what an explanation man, thank you so much
@pradeepanand5296
2 жыл бұрын
I don't think modulo is even needed if all the value is between 1 to n-1. It would be needed if values are random but then this algo not work.
@reroyallover9169
Жыл бұрын
same bro
@allenbenny5981
Жыл бұрын
modulo is needed as we may visit the same index in future and if its value is greater than n it will give error
@AbhishekKumar-ys8eq
Жыл бұрын
Same doubt here
@user-ritesh92
9 ай бұрын
damn knowledge 💥
@rajugouda8453
2 жыл бұрын
THANKS SIR 😍
@ankit_6378
2 жыл бұрын
Learned another great algo, of topic which students usually ignores. Thanks a lot #CodeIn10
@theparthsingh
2 жыл бұрын
Your consistency says everything, great work bhaiya❤️
@vedanthirlekar2660
2 ай бұрын
but what if there is one large number in array like 1000
@aftab.04
2 жыл бұрын
Day 43 and week 7 😊 compelled ❣️
@deepakgaur8954
2 жыл бұрын
Sir we are in 11 class please tell us about which stream is best for coding journey
@IAmAnonymous871
8 ай бұрын
Omg😮
@srashtifarkya4940
2 жыл бұрын
Great Great Great Bhaiya 🔥🔥💓💓
@harshk8609
2 жыл бұрын
Bro thoda speed mein krao jisse beneficial ho.
@saurabhmishra-nn5xs
2 жыл бұрын
Please sir make more than two problems per days sir
@kohimagoel5572
2 жыл бұрын
Issue in Algo for Below INPUT , Please check below, as the expected is also wrong as 4 is not repeated and it is still giving 4 as in answer, 4 3 2 7 8 2 3 1 Your Output: 2 3 4 Expected Output: 2 3 4
@pradeepanand5296
2 жыл бұрын
I think the expected value is 2 3 and output is 2 3 8 according to this algo. Question says array of size n containing upto n-1 elements. Ur array is size 8, it should contain only upto 7 cuz 8%8=0 which is giving index 0 as well also the 4%8=4 that is adding 8 to arr[4] gives 16 that's twice the value so that's why all the value in array should be lesser than array size.
@suyashsaraswar348
Жыл бұрын
Expected output : 2,3
@titusain1799
Жыл бұрын
bhaiya solution contains error for4 1 case Input: nums = [4,3,2,7,8,2,3,1] Output: [2,3,4] output should be 2,3 only
@bhushandighe6586
7 күн бұрын
Que alag hai bhai range dekho 1 To n hai tumhare que mai
@vaidehideoghare4536
Жыл бұрын
My teat case did not pass its showing error of segmentation fault
@minerbitcoin32
2 жыл бұрын
Hi brother Can you please explain the Amazon AWS deeprace event for student i am interested in it Please make video on it on how to code the model Please 🥺
@yashdeepsingh785
2 жыл бұрын
Day 43 Completed and We will keeo going. Hopes to meet you soon bhaiya ❤️
@iam_niraj
2 жыл бұрын
Consistency is the key to success. Thanks bhaiya for such lovely content.
@mdrashid3367
2 жыл бұрын
Thank you very much bhaiya 💗
@71_debduttaburman99
2 жыл бұрын
Thanks 🙏🏻
@preetkatiyar969
2 жыл бұрын
Awesooooome explanation ❤️❤️❤️❤️
@nashimbiswakarma
Жыл бұрын
Lacks dry run.
@sahiltakwale1937
Жыл бұрын
Agar index variable use hi nhi ho raha, toh declare hi kyu kiya?
@abhiop1064
2 жыл бұрын
Hello vaiya thanks for this type of videos ❤️🤞
@theharyanviskushaq
5 ай бұрын
In dry run you are creating a new array for updating the values. But in code you are updating the index of same array. If you update the original array then you will loss the original values. And arr[0]%n => 2%5 = 2 not 5 but in explanation you are adding 5 LOL.
@swarakubade2147
4 ай бұрын
Because we get the duplicate number by the index , so it doesnt matter if we lose the original values and we find the 2%5 to find the index at which we need to modify, so that and adding 5 are two different things
@vaibhavigvp
2 жыл бұрын
Thank you bhaiya for the day❤💪
@deepak__1
2 жыл бұрын
thanks for today
@shuvrodas5155
2 жыл бұрын
💕🎉🎉50k soon
@emtiazahmed5333
2 жыл бұрын
2nd comment now i am with u..i makeup all the previous lecture..
@positiveattitude9506
2 жыл бұрын
present here day 43 completed successfully best consistency bhaiya thank you Nishant bhaiya for your support ❤️ 50k soon #nishantchahar❤
@harshmishra3791
6 ай бұрын
This solution will not work for non repeting array
@karanjot_singh
2 жыл бұрын
Today Notes Problem: Find Duplicates in an array Approaches:- 1. Traverse the array and count each element. 2. Store frequency of all elements in a different array. 3. add %n for each index. vector is a dynamic array in c++, so it automatically updates its size to accommodate its elements pusback is used to add element to the back of a vector
@ezaanhussain-kt2ty
Жыл бұрын
Yours approach to find duplicate is not applicable to solve leetcode problem *find duplicate elements*
@naveenjodu21
2 жыл бұрын
great content 👌
@Abhishek-yp7vs
2 жыл бұрын
Love Babbar bhaiya ke 450 questions bhi kara dena please 😄😄
@MdRaza-ef3jj
2 жыл бұрын
Question done💥💥💥
@kaustavpurkayastha
2 жыл бұрын
Good sirji 🔥
@Asur-hq2bn
Күн бұрын
wtf is background music??? what's the point of it
@nitishsharma2194
Жыл бұрын
Si biggner ke samne vector aya hi nahi hoga to vo kya samjhe bas copy to karna nahi hai chijo ko samjhna hsi na
@abhayrajkashyap2283
2 жыл бұрын
Nyc 😍☺️
@sounak4067
2 жыл бұрын
Day 43 done 🙂
@mdtouseeb264
2 жыл бұрын
Thanx bhai🔥😎
@avishkumar6281
2 жыл бұрын
❤❤
@jitendersingh9473
2 жыл бұрын
Done
@lethalleet
2 жыл бұрын
Day 43 done
@ajaybirare1845
Жыл бұрын
Bhaiya explaination ke time pe jo music he bad me band kardo plz
@akshatsingh433
2 жыл бұрын
👍
@harikeshyadav4814
2 жыл бұрын
Day 43 🔥✅
@bhushantadele5586
8 ай бұрын
Apko kitna time laga tha pehli bar jab solve kiya tha tb.. Air ye apko khud ka logic hai kya?
@Thuglife_12
2 жыл бұрын
I need help
@GauravYadav-bj7gn
2 жыл бұрын
First here💯
@vignesh5618
2 жыл бұрын
would be helpful if you speak in english
@Thuglife_12
2 жыл бұрын
I bro i need help please help me
@palashh9
2 жыл бұрын
Second today 🔥
@Thuglife_12
2 жыл бұрын
Please really i need help
@Sunnykhatnani
Жыл бұрын
akhiri me galat bola hai
@Thuglife_12
2 жыл бұрын
You can help me
@nayanjha5670
Жыл бұрын
ye ad me aditya kachve ko dekh ke gussa aajata hai
@Thuglife_12
2 жыл бұрын
Please help me please 😭
@nitishsharma2194
Жыл бұрын
Jab array bata rahe hai ho to push pop pe Jane ki kya jarurat hai bhai sabh bigner thodi na samjhega jaldi dimple language explain karne ka na
@Thuglife_12
2 жыл бұрын
Please help me please
@navin55532
Жыл бұрын
galat explain kiya hai bhai.. pata ni kaha se 80+K subs hai tere
@lalitgaikwad7238
Жыл бұрын
you doesn't taught very well by dry running more Test Cases, your explanations are not that much clear enough. your Handwriting is also poor. LoveBabbar and Raj Vikramaditya are more Better than you in every aspect.
@anuragsaini3296
2 ай бұрын
Plzz aap padhana chod do For the sake of the universe
@Curious.chahar
2 ай бұрын
Chod diya bhai 2 saal pehle hi 😂
@anuragsaini3296
2 ай бұрын
@@Curious.chahar Just joking. My attention is not to hurt you Just kidding 😃
@HimanshuGoswami-qt6tm
7 ай бұрын
worst explaination
@ArtePixels3D
Жыл бұрын
You won one more member, I'm very grateful. Can you share your e-mail?
Пікірлер: 118