Home

Reese Weber 22.05.2026 11:24

Bloom filter

My first Python project

algo.py

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

print(reverse_string("hello"))

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

Kai Dubois 22.05.2026 11:24

Password generator #52

Pure Python, no deps

main.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:24

Recursive anagrams #40

From algorithms course

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

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

Harper Rossi 22.05.2026 11:24

Graph traversal

Extracted from a larger project

test.py

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

print(reverse_string("hello"))

Cameron Larsson 22.05.2026 11:24

Caesar cipher

Requires Python 3.11+

solver.py

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

print(gen_password())

Hayden Petrov 22.05.2026 11:23

Guess the number

Small script for learning

utils.py

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

print(factorial(5))

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

Marley Fischer 22.05.2026 11:23

CSV reader #78

Ideas welcome

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

utils.py

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

print(gen_password())

Blake Petrov 22.05.2026 11:23

Quick select

Pure Python, no deps

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

test.py

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

print(count_words("hello world foo"))

Harper Rossi 22.05.2026 11:23

Minimax AI #85

Requires Python 3.11+

test.py

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

print(reverse_string("hello"))

Logan Weber 22.05.2026 11:22

Sudoku solver

Pure Python, no deps

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

Wren Kim 22.05.2026 11:22

Password generator

Just for fun

helper.py

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

print(count_words("hello world foo"))

Marley Fischer 22.05.2026 11:22

Dynamic programming #56

Feedback appreciated

utils.py

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

print(fib(10))

Wren Kim 22.05.2026 11:22

Text analysis

My first Python project

helper.py

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

print(count_words("hello world foo"))

Rowan Kovalenko 22.05.2026 11:22

Heap sort #16

Rewrote old code

core.py

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

print(factorial(5))

models.py

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

print(reverse_string("hello"))

Jordan Smith 22.05.2026 11:21

CSV reader

Ideas welcome

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

Reese Novak 22.05.2026 11:21

Fibonacci recursive

Working prototype, needs tests

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

models.py

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

print(fib(10))

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

Jordan Smith 22.05.2026 11:21

Bloom filter

My first Python project

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

Jamie Dubois 22.05.2026 11:20

LRU cache

My first Python project

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

app.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()

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

Hayden Fischer 22.05.2026 11:20

Name generator

My first Python project

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

Rowan Kovalenko 22.05.2026 11:19

Recursive anagrams

Small script for learning

models.py

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

print(reverse_string("hello"))

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

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?