blob: 7917d4862692e8e47e92d354f09495f6ab9bb1d5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
---
title: Projects
---
If you notice a bug or want a new feature, send me a patch with [git
send-email](https://git-send-email.io).
## Site
This site is written in [Hugo][0], a static site generator. The web server is
hosted by [nginx][1].
[0]: https://gohugo.io
[1]: https://www.nginx.com/
### Getting Started
Install the latest version of Hugo.
```sh
git clone https://git.huntm.net/huntm.git
cd huntm
hugo server
```
## 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
```
|
