<jupyter_start><jupyter_text>https://leetcode.com/problems/median-of-two-sorted-arrays/description/find the median of two sorted arrays<jupyter_code>def med(nums1, nums2):
    big_list = nums1 + nums2
    big_list.sort()
    
    if(len(big_list) % 2 == 0):  # list is even and we take average of middle two numbers
        right_index = int((len(big_list))/2) + 1
        left_index = int((len(big_list))/2)
        
        return((big_list[right_index] + big_list[left_index])/2)
        
    else: #list is odd so we just return middle number
        ret_index = int((len(big_list))/2)
        return big_list[ret_index]
    
    return(big_list)
nums1 = [1,3,6]
nums2 = [2]

print(med(nums1,nums2))
l = [1,2,3,]
int((len(l))/2)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.14041994750656167, 'fraction_numerical': 0.030183727034120734, 'mean_word_length': 3.310734463276836, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '396560', 'license': 'MIT', 'n_tokens_mistral': 306, 'n_tokens_neox': 294, 'n_words': 57, 'path': 'misc/median.ipynb', 'repo_name': 'mmolnar0/sgillen_research', 'size': '762'}