aboutsummaryrefslogtreecommitdiff
path: root/content/projects/index.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/projects/index.md')
-rw-r--r--content/projects/index.md43
1 files changed, 43 insertions, 0 deletions
diff --git a/content/projects/index.md b/content/projects/index.md
new file mode 100644
index 0000000..60c3837
--- /dev/null
+++ b/content/projects/index.md
@@ -0,0 +1,43 @@
+---
+title: Projects
+---
+
+## Coding Interview Prep
+
+ This repository is a compilation of my solutions to the Blind 75, a list of
+ common types of coding problems created by a Meta (Facebook) tech lead.
+
+### Get Started
+
+Install the latest version of Java.
+
+```sh
+git clone https://git.huntm.net/coding-interview.git
+cd coding-interview
+java <name-of-problem>
+```
+
+---
+
+## Stock Picker
+
+ This program is inspired by algorithms and design patterns taught in SOFT260
+ at UNL. The application uses a dynamic programming approach to maximize the
+ value determined by the user. The problem is framed as a directed acyclic
+ graph, so the vertices can be explored in topological order. The vertices
+ represent the money spent in USD up to that point in time. The root vertex is
+ $0 and the last child visited is the total amount of money the user has to
+ spend. With the dynamic programming approach, the algorithm breaks down the
+ largest problem "maximize for value up to the buying power of the user" into
+ smaller problems where the value is maximized for buying power less than what
+ the user entered.
+
+### Get Started
+
+Install the latest version of Java.
+
+```sh
+git clone https://git.huntm.net/stocks.git
+cd stocks
+java picker.java
+```