Merge pull request #95 from pertrai1/leetcode-12222025

LeetCode Edit Distance Problem

Author: pertrai1

0072-edit-distance/README.md

@@ -18,7 +18,7 @@ A comprehensive collection of coding challenges from multiple platforms for lear
 **Progress**:
 
 - Easy: 80 problems
-- Medium: 71 problems
+- Medium: 72 problems
 - Hard: 13 problems
 
 **Quick Links**:
@@ -234,6 +234,7 @@ A comprehensive collection of coding challenges from multiple platforms for lear
 ### Dynamic Programming
 
 - [0053 - Maximum Subarray](./leetcode/medium/0053-maximum-subarray) ![Medium](https://img.shields.io/badge/Medium-orange)
+- [0072 - Edit Distance](./leetcode/medium/0072-edit-distance) ![Medium](https://img.shields.io/badge/Medium-orange)
 - [0139 - Word Break](./leetcode/medium/0139-word-break) ![Medium](https://img.shields.io/badge/Medium-orange)
 - [0198 - House Robber](./leetcode/medium/0198-house-robber) ![Medium](https://img.shields.io/badge/Medium-orange)
 - [0413 - Arithmetic Slices](./leetcode/medium/0413-arithmetic-slices) ![Medium](https://img.shields.io/badge/Medium-orange)

README.md

@@ -0,0 +1,67 @@
+# Post-Mortem Log
+
+## Problem
+
+Given two inputs, `word1: string`, `word2: string`, return the total number of operations needed to have `word1` match `word2`. The operations available are `insert`, `replace`, `delete`.
+
+- **Problem Name:** Edit Distance
+- **Problem Link (if applicable):** [https://leetcode.com/problems/edit-distance](https://leetcode.com/problems/edit-distance)
+- **Date:** 12/22/2025
+
+---
+
+## Time Tracking
+
+- **Time to design the algorithm:** 25 minutes
+- **Time to code:** 30 minutes
+
+---
+
+## Solution Exploration
+
+### What solutions did I consider or miss?
+
+- I explored using a greedy algorithm
+- Come to find out that Edit Distance is also known as Levenshtein Distance, which is usually solved using dynamic programming
+
+### Analysis
+
+- Using dynamic programming allows for remembering the distances at each of the characters for both words
+- Making sure to populate the table initially before iterating over
+- Comparing the minimum of the current character in the table with previous characters
+- Returning the correct index of the table
+
+### Was my final solution optimal?
+
+- Yes. Making use of the table and dynamic programming allows for making use of previous operations and calculations
+
+### What triggers or patterns did I find or miss?
+
+- I missed dynamic programming being the most efficient way of solving this distance problem
+
+## Mistakes & Bugs
+
+### Mistakes I keep making
+
+- Not tracing through a simple example before starting to code
+
+### Bugs to add to the Bug List
+
+- Off by one iterations that go out of bounds
+
+## Retrospective
+
+### What could I have done differently?
+
+- Setup a trace before going into the coding
+
+## Rubric Self-Rating (1–5)
+
+| Category            | Rating | Notes |
+| ------------------- | ------ | ----- |
+| **Problem solving** | 2      |       |
+| **Coding**          | 3      |       |
+| **Verification**    | 2      |       |
+| **Communication**   | 3      |       |
+
+---

leetcode/medium/0072-edit-distance/POST_MORTEM_TEMPLATE.md

@@ -0,0 +1,38 @@
+# [Edit Distance](https://leetcode.com/problems/edit-distance) ![Shield](https://img.shields.io/badge/Medium-orange)
+
+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
+
+```bash
+Input: word1 = "horse", word2 = "ros"
+Output: 3
+Explanation:
+horse -> rorse (replace 'h' with 'r')
+rorse -> rose (remove 'r')
+rose -> ros (remove 'e')
+```
+
+## Example 2
+
+```bash
+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.

leetcode/medium/0072-edit-distance/README.md

@@ -2,7 +2,7 @@
  * @time - O(m * n) where m is the length of word 1 and n is the length of word2
  * @space - O(m * n) for the DP table
  */
-function minDistance(word1: string, word2: string): number {
+export function minDistance(word1: string, word2: string): number {
   const m = word1.length;
   const n = word2.length;
 
@@ -24,9 +24,9 @@ function minDistance(word1: string, word2: string): number {
         dp[i - 1][j - 1] + (word1[i - 1] === word2[j - 1] ? 0 : 1),
         dp[i - 1][j] + 1,
         dp[i][j - 1] + 1
-      )
+      );
     }
   }
 
   return dp[m][n];
-};
+}