This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.

Weekly Kattis exercises, implementing various algorithms introduced in the course on Algorithm Design.

This repository contains the Gale-Shapley (1962) and Irving's (1985) algorithm's for Stable Matching.

An extension of the stable marriages problem which implements a novel algorithm that I created. The algorithms finds the optimum invigilation schedule that satisfies a group of n teachers (or other individuals) that must proctor m exams.