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, 17743 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, 17743 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Invert a Binary Tree
  2. Daily Interview Problem: Tree Serialization
  3. [Daily Problem] Longest Palindromic Substring
  4. Spreadsheet Column Title
  5. Algorithm Interview: No Adjacent Repeating Characters
  6. First and Last Indices of an Element in a Sorted Array
  7. Non-decreasing Array with Single Modification
  8. Algorithm Interview: Make the Largest Number
  9. Daily Interview Puzzle: Minimum Size Subarray Sum
  10. Daily Interview Problem: Min Range Needed to Sort

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

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