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

Related Articles

  1. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  2. Algorithm Interview: Maximum Path Sum in Binary Tree
  3. [Daily Problem] Angles of a Clock
  4. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  5. Consecutive Ones
  6. Spreadsheet Columns
  7. Kaprekar
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. Batch Programming in XP
  10. Sort a Partially Sorted List

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