Intersection of Two Arrays II - Leetcode 350 - Python

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order. https://leetcode.com/problems/intersection-of-two-arrays-ii/ Timestamps 00:00 Understanding the question 01:10 Intuitive hashmap solution 03:22 Two pointer solution 06:51 Hashmap solution code 08:54 Two pointer solution code 12:40 Time and Space complexity