brightlightkim

def mergeOverlappingIntervals(intervals): intervals.sort(key=lambda i:i[0]) output = [intervals[0]] for start, end in intervals[1:]: lastend = output[-1][1] if start > lastend: output.append([start, end]) else: output[-1][1] = max(end, lastend) return output

def firstDuplicateValue(array): compArray = [] for num in array: if num in compArray: return num compArray.append(num) return -1

def arrayOfProducts(array): # Write your code here. products = 1 zeroIdx = [] for i in range(len(array)): if (array[i] == 0): zeroIdx.append(i) else: products *= array[i] for i in range(len(array)): if len(zeroIdx) > 1: array[i] = 0 elif len(zeroIdx) == 1: if i in zeroIdx: array[i] = products else: array[i] = 0 else: array[i] = products / array[i] return array

def isMonotonic(array): firstChangeIndex = 1 isIncreasing = True for i in range(1, len(array)): if (i == firstChangeIndex): if array[i] array[i-1]: isIncreasing = True firstChangeIndex = -1 if firstChangeIndex != -1: firstChangeIndex += 1 else: if (array[i] > array[i-1] and not isIncreasing) or (array[i] < array[i-1] and is..

def moveElementToEnd(array, toMove): tmp = 0 for i in range(len(array)): if array[i] != toMove: array[i], array[tmp] = array[tmp], array[i] tmp += 1 return array

from sys import stdin for line in stdin: x, y = map(int, line.split()) print(abs(x - y))

import math a, b, h = map(int, input().split()) if a > h: print(1) else: print(math.ceil((h-a) / (a-b))+1)

import math s = input() sum = 0 for i in range(len(s)): sum += ord(s[i]) average = sum / len(s) print(chr(math.floor(average)))

def smallestDifference(arrayOne, arrayTwo): arrayOne.sort() arrayTwo.sort() smallest, pair = float("inf"), [] oneIdx, twoIdx = 0, 0 while (oneIdx numTwo: twoIdx += 1 else: oneIdx += 1 return..