Nicksil

# File: FindDuplicate.py
# Author: Keith Schwarz (htiek@cs.stanford.edu)
#
# An algorithm for solving the following (classic) hard interview problem:
#
# "You are given an array of integers of length n, where each element ranges
#  from 0 to n - 2, inclusive.  Prove that at least one  duplicate element must
#  exist, and give an O(n)-time, O(1)-space algorithm for finding some
#  duplicated element.  You must not modify the array elements during this 
#  process."

Nicksil

import threading

def f():
    print('Hello, World!')
    # call f() again in 30 seconds
    threading.Timer(30, f).start()
    
f()

Nicksil

import time

def execute_something():
    # code
    time.sleep(60)
    
while True:
    execute_something()

Nicksil

import math

# Pythagorean theorem
# a² + b² = c²

def distance(p, q):    
    return math.sqrt((p[0] - q[0])**2 + (p[1] - q[1])**2)
    
# >>> distance([200, 250], (300, 350))
# 141.4213562373095