<jupyter_start><jupyter_text>https://www.youtube.com/watch?v=zplklOy7ENo<jupyter_code>a = [4,10,15,24,25]
b = [0,9,12,20]
c = [5,11,22,30]
# index
x = 0
y = 0
z = 0

min_range = 1000
min_range_min = -1
min_range_max = -1

while x < len(a) and y < len(b) and z < len(c):
    curr_min = min(a[x], b[y], c[z])
    curr_max = max(a[x], b[y], c[z])
    curr_range = curr_max - curr_min
    
    if curr_range < min_range:
        min_range = curr_range
        min_range_min = curr_min
        min_range_max = curr_max
    
    # increase the minimum pointer
    if curr_min == a[x]:
        x += 1
    elif curr_min == b[y]:
        y += 1
    else:
        z += 1
        
print(min_range, min_range_min, min_range_max)<jupyter_output>2 9 11
{'fraction_non_alphanumeric': 0.14227642276422764, 'fraction_numerical': 0.052845528455284556, 'mean_word_length': 2.587378640776699, 'pattern_counts': {'":': 0, '<': 8, '<?xml version=': 0, '>': 4, 'https://': 1, 'lorem ipsum': 0, 'www.': 1, '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': '39601', 'license': 'MIT', 'n_tokens_mistral': 345, 'n_tokens_neox': 329, 'n_words': 70, 'path': 'Other/Shortest range in k-sorted list.ipynb', 'repo_name': 'deepaksood619/Python-Competitive-Programming', 'size': '738'}