From 6973081a7d00bda0f7b617f902029d9dd8033119 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Thu, 23 Feb 2017 11:25:05 +0200
Subject: [PATCH] Typo fix

---
 chapter02.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chapter02.tex b/chapter02.tex
index 875c181..15141ee 100644
--- a/chapter02.tex
+++ b/chapter02.tex
@@ -478,7 +478,7 @@ the maximum sum of a subarray that ends at that position.
 After this, the answer for the problem is the
 maximum of those sums.
 
-Condider the subproblem of finding the maximum-sum subarray
+Consider the subproblem of finding the maximum-sum subarray
 that ends at position $k$.
 There are two possibilities:
 \begin{enumerate}