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!
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
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 :)
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 :-)
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
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?
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
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.
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
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 🥺
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.
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
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.
![ละลาย (LALALYE) - DAOU PITTAYA ต้าห์อู๋ พิทยา [OFFICIAL MV]](http://i.ytimg.com/vi/wo6r9TgausI/mqdefault.jpg)
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!
Thanku for the wonderful explanation
Day 43 me - programming muje smj rhi h, thanks bhaiya :)
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
Yes it's greatful to learn you can enroll Nishant AlgoPrep DSA program for better understanding.
Mast Bhai pora samaj aa gaya...❤️Hyderabad...
Thank you for teaching us these approach to the type problems in such a simplified way.
Yes it's greatful to learn in simple way, you can enroll Nishant AlgoPrep DSA program for better understanding.
Thanks for the video bhaiya well explained......... :)
Great explanation ❤️❤️
Day 43 and week 7 😊 compelled ❣️
GFG ka same solution chipka diya hai😂
Gfg kya hai??
@@hanovarghese9411 It's a website for learning a lot of skills. Like programming languages, Databases, Cyber security and a lot of things.
@@hanovarghese9411 Geeks for geeks
Geeks for Geeks
THANKS SIR 😍
Doubt:--Why are we returning index..shoudn't we return (arr[i]-2n)??
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 :)
Great Great Great Bhaiya 🔥🔥💓💓
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 🎉❤❤
what an explanation man, thank you so much
Thanks 🙏🏻
Thank you very much bhaiya 💗
Awesooooome explanation ❤️❤️❤️❤️
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 :-)
I got the same doubt..
Ig the method only works if the maximum element of the array
@@dipesh3395 because the restriction of question is the elemets range is [1,n-1 ] then only it works
damn knowledge 💥
Day 43 Completed and We will keeo going. Hopes to meet you soon bhaiya ❤️
Thank you bhaiya for the day❤💪
why are we pushing i in ans vector instead of arr[i]?
did u get ans for ur ques?
Please sir make more than two problems per days sir
Bro in Microsoft what role u are working like web developer or app and whether u work in websites or in what
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
But what if all numbers is different like {4,6, 28, 4, 6} is it possible?
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.
Question done💥💥💥
Nishant Bhaiya giveaway ka result kab aayga...eagerly waiting for Microsoft tour 💙
Hello vaiya thanks for this type of videos ❤️🤞
thanks for today
Good sirji 🔥
Lacks dry run.
great content 👌
Your consistency says everything, great work bhaiya❤️
Learned another great algo, of topic which students usually ignores.
Thanks a lot #CodeIn10
2nd comment now i am with u..i makeup all the previous lecture..
Why are you doing redundant %n if all elements are already 0
I recommend you , Dry run krke dekho , Then you will realise
but what if range is from 0 to N and not N-1 like in the leetcode question number 442?
Thanx bhai🔥😎
Day 43 done 🙂
💕🎉🎉50k soon
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?
Consistency is the key to success. Thanks bhaiya for such lovely content.
Day 43 done
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
Que alag hai bhai range dekho 1 To n hai tumhare que mai
Done
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
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.
Expected output :
2,3
present here day 43 completed successfully best consistency bhaiya thank you Nishant bhaiya for your support ❤️ 50k soon #nishantchahar❤
but what if array has element that is greater than size of array?
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
In Question it is given that if array size in 5 then element should be in range from (1-5).
Jo questions most repeated ho companies me arrays ke wo bhi karwa digieye
Bro thoda speed mein krao jisse beneficial ho.
Nyc 😍☺️
Day 43 🔥✅
but what if there is one large number in array like 1000
Sir we are in 11 class please tell us about which stream is best for coding journey
Omg😮
❤❤
My teat case did not pass its showing error of segmentation fault
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
poor approach. It can be done in 1 loop as well.
Love Babbar bhaiya ke 450 questions bhi kara dena please 😄😄
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 🥺
👍
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.
same bro
modulo is needed as we may visit the same index in future and if its value is greater than n it will give error
Same doubt here
This solution will not work for non repeting array
Agar index variable use hi nhi ho raha, toh declare hi kyu kiya?
This solution is wrong, do anyone know any other solution for this problem?
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.
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
Second today 🔥
Yours approach to find duplicate is not applicable to solve leetcode problem *find duplicate elements*
Si biggner ke samne vector aya hi nahi hoga to vo kya samjhe bas copy to karna nahi hai chijo ko samjhna hsi na
I need help
You can help me
wtf is background music??? what's the point of it
Bhaiya explaination ke time pe jo music he bad me band kardo plz
First here💯
Please really i need help
I bro i need help please help me
Please help me please
Please help me please 😭
akhiri me galat bola hai
ye ad me aditya kachve ko dekh ke gussa aajata hai
Apko kitna time laga tha pehli bar jab solve kiya tha tb.. Air ye apko khud ka logic hai kya?
would be helpful if you speak in english
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
galat explain kiya hai bhai.. pata ni kaha se 80+K subs hai tere
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.
Plzz aap padhana chod do
For the sake of the universe
Chod diya bhai 2 saal pehle hi 😂
@@Curious.chahar Just joking. My attention is not to hurt you
Just kidding 😃
worst explaination
You won one more member, I'm very grateful. Can you share your e-mail?
Day 43 and week 7 😊 compelled ❣️
Please help me please
Please help me