minor changes

content/3_Gold/Gold_DP.md

@@ -1,14 +1,16 @@
 ---
 slug: /gold/dp
-title: "Gold - Dynamic Programming (DP)"
+title: "Gold - Dynamic Programming"
 author: Michael Cao
 ---
 
-# Gold - Dynamic Programming (DP)
+# Gold - Dynamic Programming
+
 Author: Michael Cao
 
 ## Prerequisites
-Assumes familiarity with prefix sums, recursion, Bit Operations (for Bitmask DP), and Trees (for Tree DP).
+
+Assumes familiarity with prefix sums, recursion, bit operations (for Bitmask DP), and trees (for Tree DP).
 
 ## Introduction to DP
 
@@ -28,7 +30,7 @@ Tutorials for most problems (excluding USACO) can be found on Chapter 7 of CPH.
    * [Fruit Feast (USACO Gold)](http://www.usaco.org/index.php?page=viewproblem2&cpid=574)
  * Longest Increasing Subsequence
    * [LIS in Quadratic Time](https://leetcode.com/problems/longest-increasing-subsequence/)
-      * Try to improve to $O(NlogN)$. 
+   * Try to improve to $O(N\log N)$. 
    * [Sort It Out (USACO Platinum)](http://www.usaco.org/index.php?page=viewproblem2&cpid=865)
  * Coin Change
    * [Unordered](https://cses.fi/problemset/task/1635)
@@ -81,7 +83,7 @@ Note: Has not appeared on recent USACO.
      * with 2D Prefix Sums
    * [Snakes](http://www.usaco.org/index.php?page=viewproblem2&cpid=945)
    * [Cow Poetry](http://usaco.org/index.php?page=viewproblem2&cpid=897)
-     * with fast Exponentiation
+     * with fast exponentiation
    * [Teamwork](http://usaco.org/index.php?page=viewproblem2&cpid=863)
    * [Taming the Herd](http://www.usaco.org/index.php?page=viewproblem2&cpid=815)
    * [Stamp Painting](http://www.usaco.org/index.php?page=viewproblem2&cpid=791)

content/3_Gold/Gold_Hashing.md

@@ -1,10 +1,10 @@
 ---
-slug: /gold/strings
-title: "Gold - Strings"
+slug: /gold/hashing
+title: "Gold - Hashing"
 author: Benjamin Qi
 ---
 
-# Gold - Strings
+# Gold - Hashing
 
 Author: Benjamin Qi
 

content/3_Gold/Gold_MST.md

@@ -1,7 +1,7 @@
 ---
 slug: /gold/mst
 title: "Gold - Minimum Spanning Tree"
-author: Unknown (I think Benjamin Qi)
+author: Benjamin Qi
 ---
 
 # Gold - Minimum Spanning Tree
@@ -29,12 +29,12 @@ Standard Problems:
 
 ## USACO Gold Problems
 
- - MST Problems
+ - MST
    - [Walk](http://usaco.org/index.php?page=viewproblem2&cpid=946)
      - Prim's is applicable, but the edge weights are special so you don't actually need to use an MST algo ...
    - [Fencedin](http://www.usaco.org/index.php?page=viewproblem2&cpid=623)
      - also special ...
- - DSU Problems
+ - DSU
    - [Mootube](http://www.usaco.org/index.php?page=viewproblem2&cpid=789)
      - same as [CSES Road Construction](https://cses.fi/problemset/task/1676)
    - [Closing the Farm](http://www.usaco.org/index.php?page=viewproblem2&cpid=646)

content/3_Gold/Gold_SP.md

@@ -1,5 +1,5 @@
 ---
-slug: /gold/shortest-path
+slug: /gold/sp
 title: "Gold - Shortest Path"
 author: Benjamin Qi
 ---

content/4_Plat/Plat_1DRQ.md

@@ -1,4 +1,29 @@
-# Segment Tree
+---
+slug: /plat/1DRQ
+title: "Platinum - 1D Range Queries"
+author: Benjamin Qi
+---
+
+# Platinum - 1D Range Queries
+
+Author: Benjamin Qi
+
+## Static Range Queries
+
+### Range Minimum Query
+
+  * Tutorial
+    * [Wikipedia](https://en.wikipedia.org/wiki/Range_minimum_query)
+    * (add)
+
+### General Static Range Queries
+
+* Static range queries in $O(1)$ time and $O(N\log N)$ preprocessing for any associative operation?
+  * (add)
+
+## Segment Tree
+
+Author: Benjamin Qi
 
 This data structure allows you to do point update and range query in $O(\log N)$ time each for any associative operation.
 
@@ -9,7 +34,7 @@ This data structure allows you to do point update and range query in $O(\log N)$
   * [Codeforces Tutorial](http://codeforces.com/blog/entry/18051)
   * [Slides from CPC.3](https://github.com/SuprDewd/T-414-AFLV/tree/master/03_data_structures)
 
-## Practice Problems
+### Practice Problems
 
   * [USACO Springboards](http://www.usaco.org/index.php?page=viewproblem2&cpid=995)
     * can use segment tree with min query in place of the map mentioned in analysis

content/4_Plat/Plat_2D.md

@@ -1 +0,0 @@
-# Platinum - 2D Range Queries

content/4_Plat/Plat_2DRQ.md

@@ -0,0 +1,7 @@
+---
+slug: /plat/2DRQ
+title: "Platinum - 2D Range Queries"
+author: ?
+---
+
+# Platinum - 2D Range Queries

content/4_Plat/Plat_Bitset.md

@@ -1,3 +1,9 @@
+---
+slug: /plat/bitset
+title: "Platinum - Bitset"
+author: Benjamin Qi
+---
+
 # Platinum - Bitset
 
 Author: Benjamin Qi

content/4_Plat/Plat_Fracture.md

@@ -1,5 +1,7 @@
 ---
 slug: /plat/fracture
+title: "Platinum - Fracturing Search"
+author: Benjamin Qi
 ---
 
 # Platinum - Fracturing Search

content/4_Plat/Plat_Geo.md

@@ -1,5 +1,10 @@
-(where does this even belong?)
+---
+slug: /plat/geo
+title: "Platinum - Geometry"
+author: ?
+---
 
-   - Cross product, dot product, geometry primitives (shoelace, etc.)
-   - Sweepline
-   - CPH 29, 30.1?
+ - Cross product, dot product, geometry primitives (shoelace, etc.)
+ - Sweepline
+ - CPH 29, 30.1?
+ - Convex Hull

content/4_Plat/Plat_Slope.md

@@ -1,3 +1,9 @@
+---
+slug: /plat/slope
+title: "Plat - Slope Trick"
+author: Benjamin Qi
+---
+
 # Platinum - Slope Trick
 
 Author: Benjamin Qi

content/4_Plat/Plat_Static.md

@@ -1,12 +0,0 @@
-# Static Range Queries
-
-## Range Minimum Query
-
-  * Tutorial
-    * [Wikipedia](https://en.wikipedia.org/wiki/Range_minimum_query)
-    * (add)
-
-## General Static Range Queries
-
-* Static range queries in $O(1)$ time and $O(N\log N)$ preprocessing for any associative operation?
-  * (add)

content/4_Plat/Plat_Trees.md

@@ -1,3 +1,9 @@
+---
+slug: /plat/trees
+title: "Platinum - Trees"
+author: ?
+---
+
 # Platinum - Trees
 
  - CPH 14, 18?