diff --git a/curriculum/challenges/english/08-coding-interview-prep/data-structures/incidence-matrix.english.md b/curriculum/challenges/english/08-coding-interview-prep/data-structures/incidence-matrix.english.md
index c70a131fa23..fef72bb94eb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/data-structures/incidence-matrix.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/data-structures/incidence-matrix.english.md
@@ -42,7 +42,7 @@ Graphs can also have <dfn>weights</dfn> on their edges. So far, we have <dfn>unw
 ## Instructions
 <section id='instructions'>
 Create an incidence matrix of an undirected graph with five nodes and four edges. This matrix should be in a multi-dimensional array.
-These five nodes have relationships following relationships. The first edge is between the first and second node. The second edge is between the second and third node. The third edge is between the third and fifth node. And four edge is between the fourth and second node. All edge weights are one and the edge order matters.
+These five nodes have the following relationships. The first edge is between the first and second node. The second edge is between the second and third node. The third edge is between the third and fifth node. The fourth edge is between the fourth and second node. All edge weights are one and the edge order matters.
 </section>
 
 ## Tests