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

Related Articles

  1. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  2. Daily Interview Problem: Queue Using Two Stacks
  3. Daily Interview Problem: Sort Colors
  4. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  5. Daily Interview Problem: Jump to the End
  6. Daily Interview Problem: Running Median
  7. Daily Interview Puzzle: Falling Dominoes
  8. Print a tree level-by-level, with line-breaks
  9. Sorting a list with 3 unique numbers
  10. Windows Scripting

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