diff --git a/README.en-US.md b/README.en-US.md
new file mode 100644
index 0000000..103d006
--- /dev/null
+++ b/README.en-US.md
@@ -0,0 +1,19 @@
+# introductionToAlgorithms
+
+### Review Plan
+
+1. Complete basic data structures
+
+- [x] Linked List
+- [x] Stack
+- [x] Queue
+- [x] Binary Tree, Binary Search Tree, Red-Black Tree, Balanced Tree, Trie
+- [x] Heap, Graph
+
+2. Basic algorithms
+- [x] Sorting algorithms (Heap Sort, Quick Sort, Merge Sort, Bubble Sort)
+- [x] Naive matching, Rabin-Karp algorithm (saves computation time for m), KMP string matching algorithm
+- [x] Graph algorithms (Minimum Spanning Tree, Shortest Path, Depth-First Search, Breadth-First Search)
+- [x] Dynamic Programming (need to try more scenarios and encounter more transition equations)
+- [x] Union-Find
+- [x] LRU, LFU