Projects: add site

1 files changed, 32 insertions, 12 deletions

diff --git a/content/projects/index.md b/content/projects/index.md
index f423eb3..7917d48 100644
--- a/content/projects/index.md
+++ b/content/projects/index.md
@@ -2,10 +2,31 @@
 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.
+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
 
@@ -19,16 +40,15 @@ 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.
+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