no message

Author: Partho Biswas

README.md

@@ -235,6 +235,7 @@ I have solved quite a number of problems from several topics. See the below tabl
 |36| **[273. Integer to English Words](https://tinyurl.com/y7pps4u9)** | [Python](https://tinyurl.com/wu6rdaw/273_Integer_to_English_Words.py), [Swift](https://tinyurl.com/wuja3c4/273_Integer_to_English_Words.swift) |  | Hard | MUST check again |
 |37| **[763. Partition Labels](https://tinyurl.com/yapt4n6v)** | [Python](https://tinyurl.com/wu6rdaw/763_Partition_Labels.py), [Swift](https://tinyurl.com/wuja3c4/763_Partition_Labels.swift) |  | Medium |  |
 |38| [819. Most Common Word](https://tinyurl.com/ydhwgc33) | [Python](https://tinyurl.com/wu6rdaw/819_Most_Common_Word.py), [Swift](https://tinyurl.com/wuja3c4/819_Most_Common_Word.swift) | [Art 1](https://tinyurl.com/y7u4pzeu) | Easy |  |
+|39| [350. Intersection of Two Arrays II](https://tinyurl.com/y9kdrubz) | [Python](https://tinyurl.com/wu6rdaw/350_Intersection_of_Two_Arrays_II.py), [Swift](https://tinyurl.com/wuja3c4/350_Intersection_of_Two_Arrays_II.swift) | --- | Easy | Check the follow-ups |
 
 
 </p>

leetcode.com/python/340_Longest_Substring_with_At_Most_K_Distinct_Characters.py

@@ -1,3 +1,35 @@
+# from collections import defaultdict
+# class Solution(object):
+#     def lengthOfLongestSubstringKDistinct(self, s, k):
+#         """
+#         :type s: str
+#         :type k: int
+#         :rtype: int
+#         """
+#         if not s or len(s) <= 0 or not k or k == 0:
+#             return 0
+#         charCountDict = defaultdict(int)
+#         startIdx = 0
+#         longestSubStrLen = 0
+#         for endIdx, currentChar in enumerate(s):
+#             if len(charCountDict) < k:
+#                 charCountDict[currentChar] += 1
+#             elif len(charCountDict) == k:
+#                 if currentChar in charCountDict:
+#                     charCountDict[currentChar] += 1
+#                 else:
+#                     while len(charCountDict) == k:
+#                         charToRemove = s[startIdx]
+#                         charCountDict[charToRemove] -= 1
+#                         if charCountDict[charToRemove] == 0:
+#                             del charCountDict[charToRemove]
+#                         startIdx += 1
+#                     charCountDict[currentChar] = 1
+#             longestSubStrLen = max(longestSubStrLen, endIdx - startIdx + 1)
+#         return longestSubStrLen
+
+
+# My solution during Mock
 from collections import defaultdict
 
 
@@ -8,25 +40,27 @@ def lengthOfLongestSubstringKDistinct(self, s, k):
         :type k: int
         :rtype: int
         """
-        if not s or len(s) <= 0 or not k or k == 0:
+        if len(s) <= 0 or k == 0:
             return 0
-        charCountDict = defaultdict(int)
-        startIdx = 0
-        longestSubStrLen = 0
-        for endIdx, currentChar in enumerate(s):
-            if len(charCountDict) < k:
-                charCountDict[currentChar] += 1
-            elif len(charCountDict) == k:
-                if currentChar in charCountDict:
-                    charCountDict[currentChar] += 1
-                else:
-                    while len(charCountDict) == k:
-                        charToRemove = s[startIdx]
-                        charCountDict[charToRemove] -= 1
-                        if charCountDict[charToRemove] == 0:
-                            del charCountDict[charToRemove]
-                        startIdx += 1
-                    charCountDict[currentChar] = 1
-            longestSubStrLen = max(longestSubStrLen, endIdx - startIdx + 1)
-        return longestSubStrLen
+        left, right, maxLen = 0, 0, float("-inf")
+        frequencies = defaultdict(int)
+        while right < len(s):
+            frequencies[s[right]] += 1
+            while len(frequencies) > k:
+                frequencies[s[left]] -= 1
+                if frequencies[s[left]] == 0:
+                    del frequencies[s[left]]
+                left += 1
+            maxLen = max(maxLen, right - left + 1)
+            right += 1
+        return maxLen
+
+
+"""
+length of the longest substring contains at most k distinct characters >> longest substring 
+
+"eceba"
 
+e:1
+b:1
+"""

leetcode.com/python/350_Intersection_of_Two_Arrays_II.py

@@ -0,0 +1,21 @@
+from collections import Counter
+
+
+class Solution(object):
+    def intersect(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: List[int]
+        """
+        count1 = Counter(nums1)
+        count2 = Counter(nums2)
+        result = []
+
+        for key in count1:
+            if key in count2:
+                minFreq = min(count1[key], count2[key])
+                for i in range(minFreq):
+                    result.append(key)
+
+        return result