diff options
| author | Michael Hunteman <michael@huntm.net> | 2023-07-06 11:33:31 -0500 |
|---|---|---|
| committer | Michael Hunteman <michael@huntm.net> | 2023-07-06 11:33:31 -0500 |
| commit | b7960231e3a8ce8a75ec94961d58dda1f19282c1 (patch) | |
| tree | f293d33f61d344fcb2b3bc7ec574a0ee9dba7b47 | |
| parent | 48678950b83bc828ee32cbc1af6724e58f4cd83a (diff) | |
Switch nav projects link to cgit
| -rw-r--r-- | config.toml | 2 | ||||
| -rw-r--r-- | content/projects/index.md | 61 |
2 files changed, 1 insertions, 62 deletions
diff --git a/config.toml b/config.toml index 882f4a5..2640bd9 100644 --- a/config.toml +++ b/config.toml @@ -16,7 +16,7 @@ unsafe = true weight = 2 [[menu.nav]] name = "Projects" - url = "/projects/" + url = "https://git.huntm.net" weight = 3 [[menu.nav]] name = "Books" diff --git a/content/projects/index.md b/content/projects/index.md deleted file mode 100644 index 7917d48..0000000 --- a/content/projects/index.md +++ /dev/null @@ -1,61 +0,0 @@ ---- -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 -``` |