To the Top
File:  root - text - article - 2019 - 10 - edit-distance.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 748 Views, 17769 Search Bots | 80 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

Given two strings, determine the edit distance between them. The edit distance is defined as the minimum number of edits (insertion, deletion, or substitution) needed to change one string to the other.

For example, "biting" and "sitting" have an edit distance of 2 (substitute b for s, and insert a t).

Here's the signature:

def distance(s1, s2):
# Fill this in.

print distance('biting', 'sitting')
# 2
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 748 Views, 17769 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Circle of Chained Words
  2. Sorting a list with 3 unique numbers
  3. Algorithm Interview: Determine If Linked List is Palindrome
  4. Daily Interview Problem: Queue Using Two Stacks
  5. Daily Interview Problem: Look and Say Sequence
  6. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  7. How to Play WAV music under DOS?
  8. [Daily Problem] Angles of a Clock
  9. Daily Interview Problem: Decode String
  10. [Daily Problem] Remove Consecutive Nodes that Sum to 0

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">