add 3 new easy litcode algos yandex

GishB · GishB · commit eca038f59ace · 2025-03-26T16:49:46.000+03:00
diff --git a/InterviewAlgorithms/IntersectionTwoArrays.py b/InterviewAlgorithms/IntersectionTwoArrays.py
@@ -0,0 +1,35 @@
+# https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+
+# 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.
+
+from typing import List
+
+def intersect(nums1: List[int], nums2: List[int]) -> List[int]:
+    length1 = len(nums1)
+    length2 = len(nums2)
+    intersection = []
+
+    if length1 < length2:
+        nums1, nums2 = nums2, nums1
+
+    dict_of_values = dict()
+
+    for val in nums2:
+        if dict_of_values.get(val):
+            dict_of_values[val] += 1
+        else:
+            dict_of_values[val] = 1
+
+    for val in nums1:
+        if dict_of_values.get(val):
+            counter_tmp = dict_of_values.get(val)
+            if counter_tmp > 0:
+                intersection.append(val)
+                dict_of_values[val] -= 1
+
+    return intersection
+
+if __name__ == "__main__":
+    print(intersect(nums1=[1,2,3,4,3,4,3], nums2=[3,4,3]))
diff --git a/InterviewAlgorithms/inPlaceSort.py b/InterviewAlgorithms/inPlaceSort.py
@@ -0,0 +1,31 @@
+# https://leetcode.com/problems/merge-sorted-array/
+# You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n,
+# representing the number of elements in nums1 and nums2 respectively.
+
+from typing import List
+
+def merge(nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+    """
+        Do not return anything, modify nums1 in-place instead.
+    """
+    p1 = m - 1
+    p2 = n - 1
+    p = m+n -1
+
+    while p1 >= 0 and p2 >= 0:
+        if nums1[p1] > nums2[p2]:
+            nums1[p1], nums1[p] = nums1[p], nums1[p1]
+            p1 -= 1
+        else:
+            nums1[p] = nums2[p2]
+            p2 -= 1
+        p -= 1
+
+    while p2 >= 0 and p>=0:
+        nums1[p] = nums2[p2]
+        p -= 1
+        p2 -= 1
+
+if __name__ == "__main__":
+    merge(nums1=[4,5,6,0,0,0], m=3, nums2=[1,2,3], n=3)
+    print("STOP")
diff --git a/InterviewAlgorithms/mergeTwoSortedLists.py b/InterviewAlgorithms/mergeTwoSortedLists.py
@@ -0,0 +1,30 @@
+from typing import Optional
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+def mergeTwoLists(list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
+    if list1 is None:
+        return list2
+
+    if list2 is None:
+        return list1
+
+    if list1.val <= list2.val:
+        list1.next = mergeTwoLists(list1.next, list2)
+        return list1
+    else:
+        list2.next = mergeTwoLists(list1, list2.next)
+        return list2
+
+
+
+
+if __name__ == "__main__":
+    list1 = ListNode(4, ListNode(5, ListNode(6)))
+    list2 = ListNode(1, ListNode(2, ListNode(3)))
+    test = mergeTwoLists(list1, list2)
+    print("stop")
