Intersection of Two Arrays | 4 Approaches | Leetcode 349

[@dhairyachauhan6622]

Watching Bhaiya's channel grow from 3k to 30k subs is incredible-both his channel's growth and your knowledge surge have experienced a remarkable 10x boost. As you aim for a million subs, may your journey continue to multiply with success! 🌟

[@codestorywithMIK]

Means a lot. Thank you so much ❤❤❤🙏🏻🙏🏻🙏🏻

[@user-ub2is4rs4x]

Insane growth. Its only because of the quality and dedication 👌🏻🔥

[@vivekkaradbhajne1425]

what is the name of other channel ?

[@aadarshpandit2929]

Because of you sir I have 64 days consistentency in leetcode in 2024

[@oqant0424]

POTD DONE
(10.3.24) ✅✅
Solved using two approaches on my own
got two learnings from u
Thanks ❤❤

[@vinayjoshi8714]

Great explanation Bhaiya

[@shreyaverma6538]

Many congratulations bhaiyaa🎉..keep growing..your stories are just too good.. leetcode became easy because of you🥺

[@gauravbanerjee2898]

Thanks a lot bhaiya question easy hota hai fir v kuch naya sikha hi dete ho aap ❤❤

[@aadarshpandit2929]

Thank you sir. For discussing all approaches with code ❤

[@ArjunSaxena-wl3qs]

:) Python
class Solution:
def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
intersection = set(nums1).intersection(set(nums2))
return list(intersection)

[@utkarshsahay9908]

class Solution {
public:
vector intersection(vector& nums1, vector& nums2) {
sort(nums1.begin(),nums1.end());
sort(nums2.begin(),nums2.end());
vector ans;
unordered_set st;
int i = 0,j = 0;
while(i < nums1.size() && j < nums2.size()){
if(nums1[i] < nums2[j]) i++;
else if(nums1[i] > nums2[j]) j++;
else{
if(st.find(nums1[i]) == st.end()){
st.insert(nums1[i]);
ans.push_back(nums1[i]);
}
i++;
j++;
}
}
return ans;
}
};❤❤

[@user-ub2is4rs4x]

Thanks a lot for multiple approaches. Your efforts are clearly seen in videos.
Congratulations on 31k subs

[@ektuhaso]

Thank you so much sir for all the approaches ❤
One thing sir
When i was approaching other's code on LeetCode discussion I did encounter a solution consisting of the same 2 pointer approach but for removing the duplication the algorithm used unique and erase function. Sir if possible please provide a dry run how this two functions work.❤

[@dayashankarlakhotia4943]

Well explained understood 🎉❤

[@sayantanpoddar5428]

please came up with "Remove Outermost Parentheses" solution with several approaches. Eagerly waiting.

[@rajeevyadav4223]

nice

[@RanjeetKumar-tl2nd]

Please complete the recursion series sir❤

[@akashdeepgupta2085]

Sir please start explaining leetcode contest questions also

[@codestorywithMIK]

Qn-4 coming in next few minutes

[@tutuimam3381]

❤❤❤❤❤❤

[@bharatjagoar6092]

thanks for the explanation but ,
can we solve it without using Hash set ??and by just using Arrays?

[@pranavarora3456]

hi, can you please explain 4th question of todays lc contest?

[@codestorywithMIK]

Sure. Uploading in next few minutes.

[@ugcwithaddi]

Legend 🔥

[@shabananoor9423]

❤❤❤

[@subhamcoder]

sir isme runtime error kaise aa rha haii??
sets;
sort(nums2.begin(),nums2.end());
for(auto it: nums1){
auto x = lower_bound(nums2.begin(),nums2.end(),it)-nums2.begin();;
if(it==nums2[x])s.insert(it);;
}
vectorans;
for(auto it:s)ans.emplace_back(it);
return ans;

[@utkarshsahay9908]

class Solution {
public:
vector intersection(vector& nums1, vector& nums2) {
sort(nums1.begin(),nums1.end());
sort(nums2.begin(),nums2.end());
vector ans;
int i = 0,j = 0;
while(i < nums1.size() && j < nums2.size()){
if(nums1[i] < nums2[j]) i++;
else if(nums1[i] > nums2[j]) j++;
else{
ans.push_back(nums1[i]);
while(nums1[i] == nums1[i+1] && i < nums1.size()-1) i++;
while(nums2[j] == nums2[j+1] && j < nums2.size()-1) j++;
i++;
j++;
}
}

return ans;
}
}; Why am I getting Runtime error PLEASE HELP

[@swagboltey102]

I want one suggestion is watching your videos solutions and doing worth it or should I try of my own

[@codestorywithMIK]

Please always always try from your own in the beginning.
And if you are stuck, then don’t give more than 45 minutes on a problem.
Then you can watch and understand the intuition from my video and then implement on your own.
Also, always try to understand multiple approaches if possible

[@swagboltey102]

@@codestorywithMIK ok thanks mostly I'm not able to solve of my own and stucks everytime from now I'll try again

[@kaifshaikh358]

I am very new to dsa please help me what to watch and start with dsa concepts +practical can u please rearrange videos for beginners

[@codestorywithMIK]

Hope this helps ❤️
Guidance | Q& A | Part-1 | Getting Started with DSA ? | Road Map
ruclips.net/video/2Jshfog1ETg/видео.html

[@kaifshaikh358]

@@codestorywithMIK thanks Mik but need structure approach plzz Like series of videos to watch

[@codestorywithMIK]

Let me plan this soon

[@yashvalecha2860]

Bhaiya i have some doubt how can i discuss with u personall?

[@akarsh_121]

Bhaiya abhi DSA start nahi Kiya abhi Web development seekh Raha hoon (JavaScript). Kya mujhe DSA JavaScript se start karna chahiye ya aap bata do ❤

[@codestorywithMIK]

Yes you can do DSA with JS too.
But I would suggest to continue dev with JS and practice DSA with C++ or JAVA

[@user-dr6zr2uo7c]

1st view

[@alokbhowmik3547]

First viewer ❤❤