Fixed capitalization errors (freeCodeCamp#20498)

Np -> NP
farithk · Oct 30, 2018 · 342ad14 · 342ad14
1 parent 1ea96db
commit 342ad14
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/guide/english/computer-science/np-completeness/index.md b/guide/english/computer-science/np-completeness/index.md
@@ -1,7 +1,7 @@
 ---
-title: Np Completeness
+title: NP Completeness
 ---
-## Np Completeness
+## NP Completeness
 
 NP-Complete is a property of certain types of problems. If a problem is NP-Complete, it means that there is no efficient (polynomial) algorithm to find a solution to it quickly. However, if a solution is given to us, we can quickly (in polynomial time) verify that it is correct.