<garvit244>350_1.py
def intersect( nums1, nums2):
    nums1.sort()
    nums2.sort()
    
    index_i, index_j = 0, 0
    result = []
    while index_i < len(nums1) and index_j < len(nums2):
        if nums1[index_i] == nums2[index_j]:
            result.append(nums1[index_i])
            index_i += 1
            index_j += 1
        elif nums1[index_i] > nums2[index_j]:
            index_j += 1
        else:
            index_i += 1
    return result
def sample_funcname ( var_0 , var_1 ) :
    var_0.sort ( )
    var_1.sort ( )
    var_4 , var_5 = 0 , 0
    var_6 = [ ]
    while var_4 < len ( var_0 ) and var_5 < len ( var_1 ) :
        if var_0 [ var_4 ] == var_1 [ var_5 ] :
            var_6.append ( var_0 [ var_4 ] )
            var_4 += 1
            var_5 += 1
        elif var_0 [ var_4 ] > var_1 [ var_5 ] :
            var_5 += 1
        else :
            var_4 += 1
    return var_6
