diff --git a/Dynamic Programming/LevenshteinDistance.java b/Dynamic Programming/LevenshteinDistance.java
index a196c0fe5..1844e7e8a 100644
--- a/Dynamic Programming/LevenshteinDistance.java	
+++ b/Dynamic Programming/LevenshteinDistance.java	
@@ -25,7 +25,7 @@ public class LevenshteinDistance {
             distance_mat[0][j] = j;
         }
         for (int i = 0; i < len_a; i++) {
-            for (int j = 0; i < len_b; j++) {
+            for (int j = 0; j < len_b; j++) {
                 int cost;
                 if (a.charAt(i) == b.charAt(j)) {
                     cost = 0;