Alle Neu

user:thomas Gists erstellt von Nutzer

title:mygist Gists mit Titel

filename:myfile.txt Gists mit Dateinamen

extension:yml Gists mit Dateiendung

language:go Gists in Sprache

topic:homelab gists zum gegebenen Thema

Registrieren

Anmelden

Alle Neu Registrieren Anmelden

All gists matching topic interview

Neueste erstellt
Älteste erstellt
Neueste bearbeitet
Älteste bearbeitet

linkjobai / Edit Distance: A Dynamic Programming Walkthrough

0 Favoriten
0 Forks
1 Dateien
Zuletzt aktiv 5 days ago
Interview prep notes
interview

Edit Distance: A Dynamic Programming Walkthrough

Edit Distance (LeetCode 72) asks for the minimum number of insertions, deletions and substitutions that turn one word into another. It's the textbook two-string DP and a good template for many others.

Define the state

dp[i][j] = minimum edits to turn the first i characters of a into the first j characters of b.

  • If a[i-1] == b[j-1]: dp[i][j] = dp[i-1][j-1].
  • Otherwise: 1 + min(dp[i-1][j] (delete), dp[i][j-1] (insert), dp[i-1][j-1] (replace)).
Neuer Älter

Powered by Opengist ⋅ Load: 16ms⋅

Deutsch
Čeština Deutsch English Español Français Magyar Italiano 日本語 Polski Português Русский Türkçe Українська 中文 繁體中文