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

Related Articles

  1. [Daily Problem] Course Prerequisites
  2. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  3. Daily Interview Problem: Product of Array Except Self
  4. Algorithm Interview: Make the Largest Number
  5. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  6. Daily Interview Question: Longest Sequence with Two Unique Numbers
  7. Daily Interview Problem: Running Median
  8. Non-decreasing Array with Single Modification
  9. Spectrum Master
  10. Daily Interview Question: Find Cycles in a Graph

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