LeetCode 349: Intersection of Two Arrays - Interview Prep Ep 49

Показать описание

⭐ Support my channel and connect with me:

Solutions explained:

Solution 1. We could use two hash sets, one for each array, then do intersection on both sets;
Slight modification: use the second set to hold all intersection elements rather than all distinct elements in the second array;
Solution 2. We can sort one of the two arrays, then use binary search to find intersection elements;
Solution 3. We can sort both arrays, then use two pointers to iterate through both of the sorted arrays.

// TOOLS THAT I USE:

// MY FAVORITE BOOKS:

My ENTIRE Programming Equipment and Computer Science Bookshelf:

And make sure you subscribe to my channel!

Your comments/thoughts/questions/advice will be greatly appreciated!

#softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures

Рекомендации по теме

Комментарии

thanks a lot, Sir. Your way of teaching is outstanding.

Blissfulvibes

Thank you. All three are very clear and helpful.

Chloe-sihq

I was assuming we should turn the subarray occuring in each of the vectors, so I wrote code that works for all cases but I got a seg-fault even though in my linux system, it passes all of the cases. Probably some cases don't pass in leetcode. Anyways, then I realized the order of the numbers are not considered in this question, just a set is enough to check for the occurences.

followthewhiterabbit

This is interesting, it is even more interesting LeetCode accepts your last answer. Here is why, you sort the two arrays at the beginning then compare what occurs at each index to see if they are the same. Does it work for the following array examples?

{1, 2, 3, 4} and {4, 5, 6, 7} These are pre sorted. So when your code goes to collect the numbers that are the same it wont know that it saw 4 in one set vs the other. Here is an example from wikipedia

{1, 2, 3} and {2, 3, 4} = {2, 3}
But your code says no intersect.

pashapa

how is the time complexity of the 3rd approach O(nlogn) I thought it would be O(n)

insane

LeetCode 349: Intersection of Two Arrays - Interview Prep Ep 49

Intersection of Two Arrays - Leetcode 349 - Python

LeetCode 349 | Intersection of Two Arrays | Solution Explained (Java)

LeetCode 349: Intersection of Two Arrays - Interview Prep Ep 49

Leetcode #18 | Решение 349. Intersection of Two Arrays

Leetcode | 349. Intersection of Two Arrays | Easy | Java Solution

Intersection of Two Arrays|| LEETCODE 349|| O(N) Space and O(N) time. EASY Solution.

LeetCode #349 Intersection of Two Arrays

HOW TO FIND Intersection of Two Arrays - Leetcode 349

Solving LeetCode 349 Intersection of Two Arrays | Two Pointers | HashTable | Easy | Google | Amazon

LeetCode 349. Intersection of Two Arrays

Leetcode 349-Arrays | Intersection of Two Arrays

Разбор алгоритма 349. Intersection of Two Arrays

LeetCode 349 | Intersection of Two Arrays | HashSet | Java

LeetCode 349: Intersection of Two Arrays {Using Sets}

LeetCode 349 - Intersection of Two Arrays - Easy

349. Intersection of Two Arrays Leetcode

Leetcode 349 Intersection of Two Arrays

Intersection of two arrays - leetcode 349

LeetCode 349. Intersection of Two Arrays JavaScript Solution

349. Intersection of Two Arrays | 4 Approaches | Sorting | 2 Pointer | Hash Set | Binary Search

LeetCode 349 - Intersection of Two Arrays - Python

LeetCode 349. Intersection of Two Arrays| JSer - JavaScript & Algorithm

Can YOU Improve The Solution?? - Leetcode 349 - Intersection of Two Arrays

Leetcode 349. Intersection of two Arrays || Java || Asked in FAANG