solves intersection of array 2 in python

Author: anishLearnsToCode

README.md

@@ -98,7 +98,7 @@
 | 345 | [Reverse Vowels of A String](https://leetcode.com/problems/reverse-vowels-of-a-string) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/ReverseVowelsOfString.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/reverse_vowels_of_a_string.py) |
 | 346 | 🔒 [Moving Average From Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | Easy | |
 | 349 | [Intersection of 2 Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IntersectionOfTwoArrays.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/intersection_of_2_array.py) |
-| 350 | [Intersection of 2 Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IntersectionOfTwoArraysII.java) |
+| 350 | [Intersection of 2 Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IntersectionOfTwoArraysII.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/intersection_of_2_arrays_II.py) |
 | 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | Easy | |
 | 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IsPerfectSquare.java) |
 | 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/GuessNumberHigherOrLower.java) |

python/intersection_of_2_arrays_II.py

@@ -0,0 +1,19 @@
+from typing import List, Dict
+
+
+class Solution:
+    def get_frequency(self, numbers: List[int]) -> Dict[int, int]:
+        frequency = {}
+        for number in numbers:
+            frequency[number] = frequency.get(number, 0) + 1
+        return frequency
+
+    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        result = []
+        nums1, nums2 = (nums1, nums2) if len(nums1) < len(nums2) else (nums2, nums1)
+        nums_1_freq = self.get_frequency(nums1)
+        for number in nums2:
+            if nums_1_freq.get(number, 0) >= 1:
+                result.append(number)
+                nums_1_freq[number] -= 1
+        return result