To the Top
File:  root - text - article - 2019 - 10 - edit-distance.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 746 Views, 17388 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 | 746 Views, 17388 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: H-Index
  2. Daily Interview Problem: First Missing Positive Integer
  3. [Daily Problem] Course Prerequisites
  4. Algorithm Interview Question: Symmetric k-ary Tree
  5. Daily Interview Problem: Largest BST in a Binary Tree
  6. Daily Interview Problem: Find the k-th Largest Element in a List
  7. First and Last Indices of an Element in a Sorted Array
  8. Generate All IP Addresses
  9. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  10. Number of Ways to Climb Stairs

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="noindex, follow" />