Home

Drew Kovalenko 22.05.2026 11:30

Habit tracker #45

Just for fun

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

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

handler.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:30

Minimax AI

Feedback appreciated

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

Blake Petrov 22.05.2026 11:30

Expression calculator

Work in progress

test.py

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

print(count_words("hello world foo"))

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

Sydney Petrov 22.05.2026 11:29

Mandelbrot fractal

Just for fun

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

Quinn Weber 22.05.2026 11:29

Expression calculator

Hackathon project, built in one night

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

data.py

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

print(reverse_string("hello"))

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

Hayden Petrov 22.05.2026 11:28

A* pathfinding #87

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

Sydney Santos 22.05.2026 11:28

Pomodoro timer #80

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

sdqqwwww 22.05.2026 11:27

Mandelbrot fractal

Small script for learning

hello.py

Drew Kovalenko 22.05.2026 11:27

JSON export

Pure Python, no deps

helper.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 factorial(n):
    if n == 0: return 1
    return n * factorial(n-1)

print(factorial(5))

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

Rowan Kovalenko 22.05.2026 11:27

Habit tracker

Work in progress

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

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

Morgan Tanaka 22.05.2026 11:27

Currency converter

Requires Python 3.11+

utils.py

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

print(fib(10))

app.py

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

sdqqwwww 22.05.2026 11:26

Tic-tac-toe #47

Extracted from a larger project

core.py

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

print(factorial(5))

Avery Chen 22.05.2026 11:26

File manager

Open to PRs

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

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

Morgan Tanaka 22.05.2026 11:26

Expression calculator

Work in progress

app.py

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

helper.py

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

print(reverse_string("hello"))

Rowan Nakamura 22.05.2026 11:26

Greedy algorithm

Work in progress

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

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

Marley Fischer 22.05.2026 11:25

CSV reader

Rewrote old code

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

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

Kai Smith 22.05.2026 11:25

Simple chatbot

Requires Python 3.11+

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

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

Quinn Weber 22.05.2026 11:25

Currency converter #37

Open to PRs

data.py

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

print(reverse_string("hello"))

Finley Kim 22.05.2026 11:25

Console snake

Clean and minimal

models.py

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

utils.py

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

Emery Kim 22.05.2026 11:25

Maze generator

Feedback appreciated

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

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?