added code day8 (#100)

day8/Cpp/EditDistanceday8.cpp

@@ -0,0 +1,41 @@
+/**
+ * @author:divyakhetan
+ * @date: 31/12/2018
+ */
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int min(int x, int y, int z) 
+{ 
+    return min(min(x, y), z); 
+} 
+
+int main(){
+	string s1, s2;
+	cin >> s1 >> s2;
+
+	int m = s1.length();
+	int n = s2.length();
+	int edit[m + 1][n + 1]; 
+
+	for(int i = 0; i <= n; i++){
+		edit[0][i] = i;
+	}
+
+
+	for(int i = 0; i <= m; i++){
+		edit[i][0] = i;
+	}
+
+	for(int i =  1; i <= m; i++){
+		for(int j = 1; j <= n; j++){
+			if(s1[i - 1] == s2[j - 1]) edit[i][j] = edit[i -1 ][j - 1];
+			else edit[i][j] = 1 + min(edit[ i -1][j], edit[i - 1][j - 1], edit[i][j - 1]);  
+		}
+	}
+
+	cout << "min edit distance is " << edit[m][n];
+	return 0;
+}

day8/README.md

@@ -1,4 +1,4 @@
-![cover](./cover.png)
+![cover](./cover.png)
 
 # Day 8 - Maximum Edit Distance (Levenshtein Distance)
 
@@ -154,7 +154,53 @@ int main()
 }
 ``` 
 
-### [Solution 2] (./C++/levenshtein_distance.cpp)
+### [Solution 2 by @divyakhetan](./Cpp/EditDistanceday8.cpp)
+
+```cpp
+/**
+ * @author:divyakhetan
+ * @date: 31/12/2018
+ */
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int min(int x, int y, int z) 
+{ 
+    return min(min(x, y), z); 
+} 
+
+int main(){
+	string s1, s2;
+	cin >> s1 >> s2;
+	
+	int m = s1.length();
+	int n = s2.length();
+	int edit[m + 1][n + 1]; 
+	
+	for(int i = 0; i <= n; i++){
+		edit[0][i] = i;
+	}
+	
+	
+	for(int i = 0; i <= m; i++){
+		edit[i][0] = i;
+	}
+	
+	for(int i =  1; i <= m; i++){
+		for(int j = 1; j <= n; j++){
+			if(s1[i - 1] == s2[j - 1]) edit[i][j] = edit[i -1 ][j - 1];
+			else edit[i][j] = 1 + min(edit[ i -1][j], edit[i - 1][j - 1], edit[i][j - 1]);  
+		}
+	}
+	
+	cout << "min edit distance is " << edit[m][n];
+	return 0;
+}
+``` 
+
+### [Solution 3 by @aaditkamat] (./C++/levenshtein_distance.cpp)
 
 ```cpp
 /**