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

Related Articles

  1. Find Pythagorean Triplets
  2. Windows Scripting
  3. Daily Interview Problem: Distribute Bonuses
  4. Daily Interview Problem: Buddy Strings
  5. Longest Substring Without Repeating Characters
  6. [Daily Problem] Longest Palindromic Substring
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. [Daily Problem] Validate Balanced Parentheses
  9. Most Frequent Subtree Sum
  10. Daily Interview Problem: Spiral Traversal of Grid

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">