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

Related Articles

  1. Find Pythagorean Triplets
  2. Algorithm Interview: Longest Consecutive Sequence
  3. Daily Interview Puzzle: Intersection of Linked Lists
  4. Batch Programming in XP
  5. PHP Unit Tests on VPS Server
  6. Algorithm Interview: Make the Largest Number
  7. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. Maximum In A Stack
  10. Daily Interview Puzzle: Ways to Traverse a Grid

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: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />