Update content/6_Advanced/Lagrange.mdx

Co-authored-by: Benjamin Qi <bqi343@gmail.com>

Author: A1exL1ang

content/6_Advanced/Lagrange.mdx

@@ -35,7 +35,7 @@ The problem gives us a length $N$ ($1 \le N \le 3 \cdot 10^5$) array of integers
 
 The main bottleneck of any dynamic programming solution to this problem is having to store the number of subarrays we have created so far.
 
-Let's try to find a way around this. Instead of storing the number of subarrays we have created so far, we assign a penalty of $\lambda$ for creating a new subarray (i.e. everytime we create a subarray we penalize our sum by $\lambda$).
+Let's try to find a way around this. Instead of storing the number of subarrays we have created so far, we assign a penalty of $\lambda$ for creating a new subarray (i.e. every time we create a subarray we penalize our sum by $\lambda$).
 
 This leads us to the sub-problem of finding the maximal sum and number of subarrays used if creating a new subarray costs $\lambda$. We can solve this in $\mathcal{O}(N)$ time with dynamic programming.