jackbodine Goto Github PK

advent-2022-python

In this repository, you will find my solutions to the Advent of Code 2022 challenges written in Python. Advent of Code is an annual event that provides a series of programming puzzles to solve. These solutions are my personal attempts at solving the challenges and may not be the most efficient or elegant ways of solving the puzzles.

advent-of-code-2021

My 'Advent of Code' solutions written in Rust.

assembly-assignments

Several projects and assignments I've done to learn Assembly Language/MIPS

battleship-mips

The classic 'battleship' game written in MIPS for a class project.

cinemigos-ios

The Terms and Conditions and Privacy Policy for the Cinemigos app

common-misconceptions-anki

An Anki deck based off of the list of common misconceptions on Wikipedia

drunk-philosophers

This is a machine learning project with the mission of training recurrent neural networks on text from different schools of philosophy.

eulerproblems

Code I wrote to solve the problems on ProjectEuler.net. Most solutions are in Haskell

evilhangman

An alternative to the game hangman. In this version, you play a computer that changes the word as you guess. This makes it difficult to win but still possible!

evilhangmanios

The Term and Conditions and Privacy Policy for my Evil Hangman app on iOS

jackbodine

: )

jackbodine.github.io

matheroids

This is the official repository

movie-data-analysis

nvim-config

rust-learning

This is a repository for code I've written to learn Rust. I am using The Rust Programming Language book by Steve Klabnik and Carol Nichols.

rust-practice

This repository tracks my daily practice for Rust. It contains notes, experiments, algorithms, and other resources that can be used as a reference for others also learning the language.

swift-practice

This repository tracks my daily practice for Swift. It contains notes, experiments, algorithms, and other resources that can be used as a reference for others also learning the language.

you-complete-me

A program to implement autocomplete for a given set of N terms, where a term is a string (a word) and an associated nonnegative weight. That is, given a prefix, find all terms that start with the given prefix, in descending order of weight.