Home

Cameron Larsson 22.05.2026 11:40

Working prototype, needs tests

solver.py

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

print(gen_password())

utils.py

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

print(factorial(5))

Nico Johansson 22.05.2026 11:40

Text analysis

Hackathon project, built in one night

models.py

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

print(factorial(5))

config.py

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

print(fib(10))

Harper Rossi 22.05.2026 11:40

Expression calculator #82

Work in progress

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

app.py

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

print(reverse_string("hello"))

test.py

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

print(reverse_string("hello"))

Hayden Fischer 22.05.2026 11:40

Text adventure

Extracted from a larger project

solver.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"))

utils.py

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

print(gen_password())

Avery Chen 22.05.2026 11:39

Graph traversal #43

Rewrote old code

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

app.py

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

print(fib(10))

Parker Petrov 22.05.2026 11:39

Note manager

My first Python project

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

Wren Novak 22.05.2026 11:39

Bloom filter

Rewrote old code

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

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

Avery Patel 22.05.2026 11:38

Bloom filter

Requires Python 3.11+

main.py

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

print(reverse_string("hello"))

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

Kai Patel 22.05.2026 11:37

Minimax AI #98

Working prototype, needs tests

data.py

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

algo.py

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

print(fib(10))

test.py

class Node:
    def __init__(self, val):
        self.val = val
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None
    def append(self, val):
        if not self.head:
            self.head = Node(val)
            return
        cur = self.head
        while cur.next: cur = cur.next
        cur.next = Node(val)
    def display(self):
        cur = self.head
        while cur:
            print(cur.val, end=' ')
            cur = cur.next
        print()

ll = LinkedList()
ll.append(1); ll.append(2); ll.append(3)
ll.display()

Rowan Kovalenko 22.05.2026 11:37

Fibonacci recursive

core.py

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

print(factorial(5))

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

wizy 22.05.2026 11:37

asdasd

from dsdsdssds.hello import hello

hello()
a
a
a
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
aa
a

Tatum Garcia 22.05.2026 11:37

Password generator #3

Working prototype, needs tests

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

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

data.py

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

print(gen_password())

Reese Chen 22.05.2026 11:37

Simple HTTP server

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

Wren Kim 22.05.2026 11:36

Console snake

Hackathon project, built in one night

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

Logan Johansson 22.05.2026 11:36

Mood diary

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

Rowan Kovalenko 22.05.2026 11:36

Mood diary

Extracted from a larger project

core.py

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

print(factorial(5))

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

models.py

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

print(reverse_string("hello"))

Morgan Garcia 22.05.2026 11:36

Guess the number #81

Hackathon project, built in one night

utils.py

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

utils.py

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

print(factorial(5))

Reese Novak 22.05.2026 11:36

Caesar cipher

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

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

Cameron Larsson 22.05.2026 11:35

Text analysis #55

Requires Python 3.11+

utils.py

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

print(factorial(5))

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

solver.py

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

print(gen_password())

Morgan Tanaka 22.05.2026 11:35

Habit tracker #47

Ideas welcome

helper.py

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

print(reverse_string("hello"))

app.py

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

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?