Home

Wren Kim 22.05.2026 11:05

Requires Python 3.11+

helper.py

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

print(count_words("hello world foo"))

core.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 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]))

Finley Kim 22.05.2026 11:05

Name generator

Extracted from a larger project

models.py

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

utils.py

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

Finley Garcia 22.05.2026 11:04

Minimax AI #47

My first Python project

test.py

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

main.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))

handler.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))

sdqqwwww 22.05.2026 11:04

Console snake

From algorithms course

hello.py

Drew Smith 22.05.2026 11:03

Mood diary

Open to PRs

helper.py

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

print(factorial(5))

solver.py

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

print(gen_password())

handler.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'))

Logan Johansson 22.05.2026 11:03

Guess the number

Extracted from a larger project

algo.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))

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]))

sdqqwwww 22.05.2026 11:03

Multiplication table

Working prototype, needs tests

hello.py

Morgan Garcia 22.05.2026 11:03

Dynamic programming

Clean and minimal

utils.py

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

Marley Fischer 22.05.2026 11:03

Caesar cipher

Small script for learning

utils.py

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

print(fib(10))

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]))

algo.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

Morgan Garcia 22.05.2026 11:02

Mood diary

Feedback appreciated

utils.py

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

Marley Fischer 22.05.2026 11:02

Mandelbrot fractal

From algorithms course

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]))

utils.py

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

print(fib(10))

utils.py

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

print(gen_password())

Finley Garcia 22.05.2026 11:02

Simple chatbot

test.py

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

main.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))

handler.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))

Drew Smith 22.05.2026 11:01

Bubble sort

Pure Python, no deps

handler.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'))

solver.py

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

print(gen_password())

Logan Johansson 22.05.2026 11:01

Currency converter #74

My first Python project

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]))

Tatum Johansson 22.05.2026 11:01

LRU cache #66

Requires Python 3.11+

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))

Morgan Garcia 22.05.2026 11:00

Backup utility

Open to PRs

utils.py

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

print(factorial(5))

utils.py

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

Tatum Johansson 22.05.2026 11:00

Heap sort

Open to PRs

core.py

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

print(fib(10))

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]))

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))

Morgan Garcia 22.05.2026 11:00

Guess the number

Just for fun

utils.py

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

print(factorial(5))

Marley Fischer 22.05.2026 11:00

Habit tracker

From algorithms course

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]))

algo.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

Morgan Garcia 22.05.2026 10:59

Stack implementation

Just for fun

utils.py

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

print(factorial(5))

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?