May Day 31. Yaay Finally!!!

Author: thepushkarp

MayChallenge/Week5/31:EditDistance.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+ int minDistance(string word1, string word2) {
+ int len1 = word1.size(), len2 = word2.size();
+ vector<vector<int>> dp(2, vector<int>(len1 + 1, 0));
+ for (int i = 0; i <= len1; i++) {
+ dp[0][i] = i;
+ }
+ for (int i = 1; i <= len2; i++) {
+ for (int j = 0; j <= len1; j++) {
+ if (j == 0) {
+ dp[i % 2][j] = i;
+ }
+ else if (word1[j - 1] == word2[i - 1]) { 
+ dp[i % 2][j] = dp[(i - 1) % 2][j - 1]; 
+ }
+ else {
+ dp[i % 2][j] = 1 + min({dp[(i-1) % 2][j], dp[i % 2][j - 1], dp[(i - 1) % 2][j - 1]});
+ }
+ }
+ }
+ return dp[len2 % 2][len1];
+ }
+};

README.md

@@ -139,4 +139,4 @@ Since I am completing this in May, I could not access the 7th question of each w
 | --- | ------------------------------------------------------------------------------ |
 | 29 | [Course Schedule](MayChallenge/Week5/29:CourseSchedule.cpp) |
 | 30 | [K Closest Points to Origin](MayChallenge/Week5/30:KClosestPointstoOrigin.cpp) |
-| 31 |   |
+| 31 | [Edit Distance](MayChallenge/Week5/31:EditDistance.cpp) |