Flavio Pezzini

Problem Description:
Molly wants to buy laptops for her school, and I use Java to determine how many laptops she can purchase by comparing the vendors available. Each vendor sells the laptops in batches, with a quantity identifying how many laptops are in each batch, the price for the whole batch, and the parameters determining which laptop batches Molly should purchase for her school based on the available batch size and price.

I developed a Java-based solution that required permutation and dynamic programming. It involved a variation of the common knapsack 0/1 solution.

Sample input: 50 [20,19] [24,20]
• Molly has 50 dollars to spend.
• The first vendor has 20 laptops per batch, and each batch costs 24 dollars.
• The second vendor has 19 laptops per batch, and each batch costs 20 dollars.

The possible answers are 40 and 38.

If she buys from the first vendor, she will spend 48 dollars (24*2), and since she's buying two batches, the total quantity is 40 (20*2). However, if she buys from the second vendor, the maximum amount would be 38 since each batch has 19 laptops, and she'd run out of money after the second batch.

The final answer is then 40 since 40 is higher than 38.

A Spring application that uses OAuth2 to connect to Strava using the Athlete's credentials and pulls the latest week of exercises and formats it nicely so it can be posted on internet discussion boards.

A Rust program to compare Poker Hands using all the poker rules; for instance, a pair is stronger than a high card, a flush is stronger than a pair, and so on.
It served as a starting point in my track towards learning Rust.