A collection of fun problems I solved with Python
largest_sum_less_than_M.py
-Solves a modification of the Knapsack problem that requires an exact amount of items.
-Uses a dynamic programing solution
prime_sieve.py
-Functions for calculating prime numbers