diff --git a/370/notes/1.md b/370/notes/1.md
deleted file mode 100644
index a48d448..0000000
--- a/370/notes/1.md
+++ /dev/null
@@ -1,6 +0,0 @@
-# lec1
-> trees & tree heaps 
-> also: ilearn still busted but theres a survey to fill out
-
-bin search trees
-max/min/heap trees
diff --git a/370/notes/2.md b/370/notes/2.md
deleted file mode 100644
index 6425e74..0000000
--- a/370/notes/2.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Divide and Conquer
-
-Make big problem into smaller problems to solve
-
-## Merge Sort
-
-_yote_
-
-1. find midpoint of list
-2. split into two smaller lists
-3. keep splitting smaller lists until we have a bunch of 1/2 size lists
-4. sort each using the _smaller_ already sorted values against each other into a new sub-list
-5. combine and sort each thing