diff --git a/content/posts/using-js-sets-to-find-elements.md b/content/posts/using-js-sets-to-find-elements.md
index 49ca705..2b5bf2b 100644
--- a/content/posts/using-js-sets-to-find-elements.md
+++ b/content/posts/using-js-sets-to-find-elements.md
@@ -5,26 +5,7 @@ tags:
   - Tech
 description: >-
   JS's `new Set()` can be the new Hash table optimization for reducing nested
-  loops.
-
-
-  ```js
-
-  // Example Data
-
-  let hugeArray = [...Array(10000).keys()].map(id => { return {id}; }); // [{id:
-  0}, ..., {id: 9999}]
-
-  let needles = [1010, 2020, 3030, 4040, 5050, 6060, 7070, 8080, 9090];
-
-
-  // Finding matching elements
-
-  let needlesSet = new Set(needles);
-
-  let matches = hugeArray.filter(obj => needlesSet.has(obj.id));
-
-  ```
+  loops. So I've put together a little code snippet to show this in practice.
 ---
 Functionally for one check, this is identical to checking the `.indexOf()` or `.includes()` of an Array. However, in cases where you're filtering a large array down to match a list of ID's, for example, the nested looping can result in a performance hit.