Find the Difference of Two Arrays - Leetcode 2215 - Python

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
Solving Find the Difference of Two Arrays - Leetcode 2215, today's daily leetcode on May 2nd.
🥷 Discord: / discord
🐦 Twitter: / neetcode1
🐮 Support the channel: / neetcode
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetco...
Problem Link: leetcode.com/problems/find-th...
0:00 - Read the problem
0:30 - Drawing Explanation
3:35 - Coding Explanation
leetcode 2215
#neetcode #leetcode #python

[@callofduty1]

I also solved it today, and this is my approach: set1 = set(nums1) set2 = set(nums2) return [list(set1 - set2), list(set2 - set1)]

[@Andrew_J123]

This was my first thought too

[@callofduty1]

@@Andrew_J123 The reason I went with this approach is because it's short, simple and easy to understand for beginners,

[@DeathSugar]

what numbers it yielded?

[@jymival2355]

You have explained the problem in a way more complicated way than it has to be. You dont need set to list conversions. When you turn the lists into sets at the beginning to get constant time access to the numbers you also instantly remove any duplicates. From there you can either just use 2 list comprehensions or write a for loop or even use more pythonic code like set1-set2. The problem is obviously aimed at beginners so no need to make it any more confusing by worrying about duplicates in a set and then adding them to another set and then making it a list when there were no duplicates anymore at all in the beginning.

[@NeetCodeIO]

True that we should iterate the sets rather than lists. But for the pythonic solution, I usually try to avoid those to make it readable for ppl from other langs.

[@jymival2355]

@@NeetCodeIOyeah i totally understand why you wouldnt want to use too much pythonic code due to people watching that maybe dont code in python and non pythonic solutions help create a deeper knowledge of coding and the ideas behind it. I love your videos and they help me a ton just wanted to point it out.

[@blossomprogrammingworld4654]

good day, I just came across your channel and I have been following it. It's good and I appreciate the explanation. I will appreciate it if more video on programming skill study plan from leetcode was created. Many thanks for considering my request.

[@kirillzlobin7135]

Great video!

[@notgreen11]

my first thoughts for this problem were: 1) O(n+m) space and time, turn the arrays into sets, and use those to form the output 2) sort the arrays with O(n log n) time and O(1) space. Iterate over each array and perform a binary lookup (log n) in the second array. This gives n log m + m log n time

[@asmahamdym]

they say that result is only of length 2 so I initialized res like this: res = [ [ ], [ ] ] and append to res[0] and res[1]

[@keerthivasan764]

Bro when does google lift hiring freeze

[@HarshaVardhan-fu9kv]

Bro when you converted list into set (line 3) then duplicates are removed, no need to fear about that

[@massimomonticelli6010]

Agreed: instead of traversing nums1 (line 6) and nums2 (line 10), just traverse nums1Set and nums2Set. In this way, both res1 and res2 can be lists.

[@NeetCodeIO]

Yep, a silly mistake on my part. Should've iterated through the Sets not the Lists.

[@TheElementFive]

class Solution: def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]: a = set(nums1).difference(set(nums2)) b = set(nums2).difference(set(nums1)) return [list(a), list(b)]

[@vignan555]

@TheElementFive as the set is unordered how we are getting the relative order

[@mohamedhassan-ub4kj]

why don't you use hash map and map each element to it with value 1 , then remove elements from the hash keys while building the answer2 , lastly loop through the remaining keys and build the ans1 and return [ans1 , ans2]

[@vignan555]

@NeetCodeIO: as the list is unordered how we are getting the relative order

[@vignan555]

sorry set

[@ChandraNandan-mb5sq]

class Solution: def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]: answer = [[],[]] max_len = max(len(nums1),len(nums2)) for i in range(max_len): if i < len(nums1): if nums1[i] not in nums2 and nums1[i] not in answer[0]: answer[0].append(nums1[i]) if i < len(nums2): if nums2[i] not in nums1 and nums2[i] not in answer[1]: answer[1].append(nums2[i]) return answer