diff --git a/guide/english/computer-science/dynamic-programming/index.md b/guide/english/computer-science/dynamic-programming/index.md
index 2fe75cfe63..8de119d70d 100644
--- a/guide/english/computer-science/dynamic-programming/index.md
+++ b/guide/english/computer-science/dynamic-programming/index.md
@@ -44,7 +44,7 @@ def fib(n)
     return lookup[n]
 }
 ```
-Caching computed solutions in a lookup table, and query it before go recursion will let the program have a running time of O(N).
+Caching computed solutions in a lookup table, and querying it before going for recursion will let the program have a running time of O(N).
 
 #### More Information: