Home

Riley Fischer 22.05.2026 11:15

Weather parser

Pure Python, no deps

core.py

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

Drew Smith 22.05.2026 11:15

Fibonacci recursive #42

Just for fun

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

helper.py

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

print(factorial(5))

Logan Johansson 22.05.2026 11:15

Trie implementation

Work in progress

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

Logan Johansson 22.05.2026 11:14

Note manager

Pure Python, no deps

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

Dakota Nakamura 22.05.2026 11:14

A* pathfinding

From algorithms course

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

Reese Weber 22.05.2026 11:14

Caesar cipher

Pure Python, no deps

algo.py

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

print(reverse_string("hello"))

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

Drew Dubois 22.05.2026 11:13

Currency converter #57

Pure Python, no deps

data.py

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

print(reverse_string("hello"))

main.py

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

print(reverse_string("hello"))

Drew Fischer 22.05.2026 11:13

Markdown parser

Work in progress

utils.py

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

print(reverse_string("hello"))

Riley Fischer 22.05.2026 11:13

Binary search

Hackathon project, built in one night

core.py

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

core.py

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

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:13

Currency converter

Extracted from a larger project

models.py

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

print(reverse_string("hello"))

Logan Johansson 22.05.2026 11:13

Merge sort

Working prototype, needs tests

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

Morgan Garcia 22.05.2026 11:13

Fibonacci recursive #20

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

Reese Weber 22.05.2026 11:12

Fibonacci recursive

Just for fun

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

test.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 Weber 22.05.2026 11:12

Name generator #77

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

Rowan Kovalenko 22.05.2026 11:12

File manager

Rewrote old code

core.py

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

print(factorial(5))

Finley Kim 22.05.2026 11:12

Weather parser #27

Clean and minimal

utils.py

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

Finley Garcia 22.05.2026 11:11

Recursive anagrams #91

Clean and minimal

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

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

Emery Kim 22.05.2026 11:11

Binary search

Working prototype, needs tests

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

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

Wren Kim 22.05.2026 11:11

Backup utility #47

Hackathon project, built in one night

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

helper.py

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

print(count_words("hello world foo"))

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

Hayden Fischer 22.05.2026 11:11

Console snake #97

Clean and minimal

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

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?