Home

Taylor Larsson 22.05.2026 11:50

Bubble sort #21

My first Python project

data.py

import random
def gen_password(length=12):
    chars = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%"
    return "".join(random.choice(chars) for _ in range(length))

print(gen_password())

config.py

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

print(bubble_sort([5, 3, 8, 1, 2]))

test.py

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target: return mid
        elif arr[mid] < target: lo = mid + 1
        else: hi = mid - 1
    return -1

print(binary_search([1,3,5,7,9], 7))

Blake Petrov 22.05.2026 11:49

Name generator #2

Open to PRs

utils.py

def max_in_list(lst):
    m = lst[0]
    for x in lst:
        if x > m: m = x
    return m

print(max_in_list([3, 7, 1, 9, 4]))

core.py

def max_in_list(lst):
    m = lst[0]
    for x in lst:
        if x > m: m = x
    return m

print(max_in_list([3, 7, 1, 9, 4]))

Jordan O'Brien 22.05.2026 11:49

Backup utility

Requires Python 3.11+

handler.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

handler.py

def max_in_list(lst):
    m = lst[0]
    for x in lst:
        if x > m: m = x
    return m

print(max_in_list([3, 7, 1, 9, 4]))

Hayden Rossi 22.05.2026 11:49

Guess the number #65

My first Python project

config.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

Zion Smith 22.05.2026 11:48

CSV reader

Rewrote old code

config.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

main.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

core.py

def debounce(fn, delay):
    import time
    last = [0.0]
    def wrapper(*args):
        now = time.time()
        if now - last[0] >= delay:
            last[0] = now
            return fn(*args)
    return wrapper

Dakota Nakamura 22.05.2026 11:48

Console snake #8

Small script for learning

core.py

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target: return mid
        elif arr[mid] < target: lo = mid + 1
        else: hi = mid - 1
    return -1

print(binary_search([1,3,5,7,9], 7))

Jordan Silva 22.05.2026 11:48

Graph traversal

Requires Python 3.11+

utils.py

def caesar_cipher(text, shift=3):
    result = ""
    for ch in text:
        if ch.isalpha():
            base = ord("A") if ch.isupper() else ord("a")
            result += chr((ord(ch) - base + shift) % 26 + base)
        else: result += ch
    return result

print(caesar_cipher("Hello World"))

Tatum Johansson 22.05.2026 11:48

Binary search

Rewrote old code

utils.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

views.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

config.py

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target: return mid
        elif arr[mid] < target: lo = mid + 1
        else: hi = mid - 1
    return -1

print(binary_search([1,3,5,7,9], 7))

Sage Weber 22.05.2026 11:48

Simple HTTP server #7

solver.py

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

print(bubble_sort([5, 3, 8, 1, 2]))

Harper Santos 22.05.2026 11:48

LRU cache

Requires Python 3.11+

views.py

def hello():
    print("Hello, World!")

models.py

def factorial(n):
    if n == 0: return 1
    return n * factorial(n-1)

print(factorial(5))

Rowan Kim 22.05.2026 11:47

Fibonacci recursive

views.py

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

print(bubble_sort([5, 3, 8, 1, 2]))

core.py

def memoize(fn):
    cache = {}
    def wrapper(*args):
        if args not in cache:
            cache[args] = fn(*args)
        return cache[args]
    return wrapper

@memoize
def expensive(n):
    return sum(range(n))

print(expensive(1000000))

main.py

def hello():
    print("Hello, World!")

Reese Chen 22.05.2026 11:46

Concurrent queue

Ideas welcome

helper.py

def reverse_string(s): return s[::-1]

print(reverse_string("hello"))

views.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

app.py

import random
def gen_password(length=12):
    chars = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!@#$%"
    return "".join(random.choice(chars) for _ in range(length))

print(gen_password())

Harper O'Brien 22.05.2026 11:46

Merge sort #34

Work in progress

handler.py

def fib(n):
    if n <= 1: return n
    return fib(n-1) + fib(n-2)

print(fib(10))

utils.py

def factorial(n):
    if n == 0: return 1
    return n * factorial(n-1)

print(factorial(5))

Blake O'Brien 22.05.2026 11:46

File manager

Rewrote old code

utils.py

def debounce(fn, delay):
    import time
    last = [0.0]
    def wrapper(*args):
        now = time.time()
        if now - last[0] >= delay:
            last[0] = now
            return fn(*args)
    return wrapper

app.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

algo.py

def caesar_cipher(text, shift=3):
    result = ""
    for ch in text:
        if ch.isalpha():
            base = ord("A") if ch.isupper() else ord("a")
            result += chr((ord(ch) - base + shift) % 26 + base)
        else: result += ch
    return result

print(caesar_cipher("Hello World"))

Quinn Larsson 22.05.2026 11:46

Text adventure

Rewrote old code

test.py

def hello():
    print("Hello, World!")

solver.py

def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0: return False
    return True

print(is_prime(17))

views.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

Zion Smith 22.05.2026 11:46

Caesar cipher

Pure Python, no deps

core.py

def debounce(fn, delay):
    import time
    last = [0.0]
    def wrapper(*args):
        now = time.time()
        if now - last[0] >= delay:
            last[0] = now
            return fn(*args)
    return wrapper

config.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

Finley Larsson 22.05.2026 11:46

Currency converter #27

Extracted from a larger project

main.py

def hello():
    print("Hello, World!")

views.py

def count_words(text): return len(text.split())

print(count_words("hello world foo"))

Jordan O'Brien 22.05.2026 11:46

Currency converter

Extracted from a larger project

main.py

def hello():
    print("Hello, World!")

handler.py

def max_in_list(lst):
    m = lst[0]
    for x in lst:
        if x > m: m = x
    return m

print(max_in_list([3, 7, 1, 9, 4]))

Tatum Garcia 22.05.2026 11:45

Bloom filter #57

Clean and minimal

views.py

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target: return mid
        elif arr[mid] < target: lo = mid + 1
        else: hi = mid - 1
    return -1

print(binary_search([1,3,5,7,9], 7))

Harper Rossi 22.05.2026 11:45

Multiplication table

Small script for learning

data.py

from collections import Counter
def top_words(text, n=5):
    words = text.lower().split()
    return Counter(words).most_common(n)

print(top_words('the cat sat on the mat the cat'))

test.py

def reverse_string(s): return s[::-1]

print(reverse_string("hello"))

app.py

def reverse_string(s): return s[::-1]

print(reverse_string("hello"))

Feed

Top Posts

Multiplication table

Simple HTTP server

Name generator

Stack implementation

Password generator #95

Feed

Top Posts

Multiplication table

Simple HTTP server

Name generator

Stack implementation

Password generator #95

Are you sure you want to delete this post?