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

Related Articles

  1. First and Last Indices of an Element in a Sorted Array
  2. Absolute Path
  3. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  4. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  5. Algorithm Interview: Permutations of numbers
  6. Daily Interview Problem: Merge List Of Number Into Ranges
  7. Sort a Partially Sorted List
  8. Maximum In A Stack
  9. Daily Interview Problem: Product of Array Except Self
  10. [Daily Problem] Witness of The Tall People

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