bezzad
diff --git a/‎42. Trapping Rain Water/42. Trapping Rain Water.js
Lines changed: 35 additions & 0 deletions b/‎42. Trapping Rain Water/42. Trapping Rain Water.js
Lines changed: 35 additions & 0 deletions
diff --git a/‎42. Trapping Rain Water/Question.md
Lines changed: 23 additions & 0 deletions b/‎42. Trapping Rain Water/Question.md
Lines changed: 23 additions & 0 deletions
diff --git a/‎72. Edit Distance/72. Edit Distance.js
Lines changed: 33 additions & 0 deletions b/‎72. Edit Distance/72. Edit Distance.js
Lines changed: 33 additions & 0 deletions
diff --git a/‎72. Edit Distance/Question.md
Lines changed: 33 additions & 0 deletions b/‎72. Edit Distance/Question.md
Lines changed: 33 additions & 0 deletions
@@ -0,0 +1,35 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+ */
+var trap = function (height) {
+    let sum = 0;
+    let floorCount = Math.max(...height);
+
+    for (let f = 1; f <= floorCount; f++) {
+        let firstLeftStone = height.length, firstRightStone = 0;
+        for (let l = 0; l < height.length; l++) {
+            if (height[l] >= f) {
+                firstLeftStone = l;
+                break;
+            }
+        }
+        for (let r = height.length - 1; r > firstLeftStone; r--) {
+            if (height[r] >= f) {
+                firstRightStone = r;
+                break;
+            }
+        }
+        for (let i = firstLeftStone; i < firstRightStone; i++) {
+            if (height[i] < f) {
+                sum++;
+            }
+        }
+    }
+
+    return sum;
+};
 
+console.assert(trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]) == 6, "1");
+console.assert(trap([4, 2, 0, 3, 2, 5]) == 9, "2");
+console.assert(trap([2, 0, 2]) == 2, "3");
@@ -0,0 +1,23 @@
+Given `n` non-negative integers representing an elevation map where the width of each bar is `1`, compute how much water it can trap after raining.
+
+## Example 1:
+
+![](https://assets.leetcode.com/uploads/2018/10/22/rainwatertrap.png)
+
+```
+Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
+Output: 6
+Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.
+```
+
+## Example 2:
+```
+Input: height = [4,2,0,3,2,5]
+Output: 9
+```
+
+Constraints:
+
+* `n == height.length`
+* `0 <= n <= 3 * 104`
+* `0 <= height[i] <= 105`
@@ -0,0 +1,33 @@
+/**
+ * @param {string} word1
+ * @param {string} word2
+ * @return {number}
+ */
+var minDistance = function (word1, word2) {
+    let largWord = word1.length >= word2.length ? word1 : word2;
+    let smallWord = word1.length >= word2.length ? word2 : word1;
+    let distance = 0;
+    for (let i = 0; i < smallWord.length; i++) {
+        for (let j = 0; j < largWord.length; j++) {
+            
+        }
+    }
+    return distance;
+};
+
+function insert(word, index, char) {
+    return word.slice(0, index) + char + word.slice(index);
+}
+
+function replace(word, index, char) {
+    return word.slice(0, index) + char + word.slice(index + 1);
+}
+
+function remove(word, index) {
+    return word.slice(0, index) + word.slice(index + 1);
+}
+
+
+console.assert(minDistance("horse", "ros") == 3, "1");
+console.assert(minDistance("intention", "execution") == 5, "2");
+console.assert(minDistance("tour", "ruot") == 4, "3");
@@ -0,0 +1,33 @@
+Given two strings `word1` and `word2`, return the minimum number of operations required to convert `word1` to `word2`.
+
+You have the following three operations permitted on a word:
+
+`Insert` a character
+`Delete` a character
+`Replace` a character
+
+## Example 1:
+```
+Input: word1 = "horse", word2 = "ros"
+Output: 3
+Explanation: 
+horse -> rorse (replace 'h' with 'r')
+rorse -> rose (remove 'r')
+rose -> ros (remove 'e')
+```
+## Example 2:
+```
+Input: word1 = "intention", word2 = "execution"
+Output: 5
+Explanation: 
+intention -> inention (remove 't')
+inention -> enention (replace 'i' with 'e')
+enention -> exention (replace 'n' with 'x')
+exention -> exection (replace 'n' with 'c')
+exection -> execution (insert 'u')
+```
+
+## Constraints:
+
+* `0 <= word1.length, word2.length <= 500`
+* `word1 and word2 consist of lowercase English letters.`