diff --git a/writing/content/index.html b/writing/content/index.html
index f35d5f7..f53c448 100644
--- a/writing/content/index.html
+++ b/writing/content/index.html
@@ -20,43 +20,22 @@
 
 <body>
     <article>
-        <h1 id="rmq">The RMQ Problem in Rust</h1>
+        <h1 id="idx">String Indexing: A Rust Implementation</h1>
 
-        <h2>A Naive Solution</h2>
+        <h2>Substring Search</h2>
 
-        <h2>Binary Representation and Sparse Tables</h2>
+        <h2>The Suffix Array: Part I</h2>
 
-        <h3>Preprocessing</h3>
-        <h3>Querying the Sparse Table</h3>
+        <h3>A Naïve Solution via Sorting</h3>
 
-        <h2>The Method of Four Russians </h2>
-        <h3>Two Level Structures</h3>
-        <h3>Hybrid Structures</h3>
+        <h2>The LCP Array</h2>
+        <h3>The Naive Solution</h3>
+        <h3>Kasai's Procedure</h3>
         
 
-        <h2>Cartesian Trees & The LCA-RMQ Equivalence</h2>
-        <h3>Cartesian Trees</h3>
-        <h3>Cartesian Tree Isomorphisms</h3>
-        <h3>The Fischer-Heun RMQ Structure</h3>
+        <h2>The Suffix Array: Part II</h2>
 
-        <table>
-            <thead>
-              <tr>
-                <th>Block Size</th>
-                <th>Macro Array Method</th>
-                <th>Micro Array Method</th>
-                <th>Runtime</th>
-              </tr>
-            </thead>
-            <tbody>
-              <tr>
-                <td>`0.25 lg n`</td>
-                <td>Sparse Table</td>
-                <td>Sparse Table with Cartesian Tree based caching</td>
-                <td>`&lt;O(n), O(1)&gt;`</td>
-              </tr>
-            </tbody>
-          </table>
+        <h3>SA-IS: A suffix array via Induced Sorting</h3>
           
 
         <h2>References</h2>
