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, 17190 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, 17190 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Product of Array Except Self
  2. Algorithm Interview: Subarray With Target Sum
  3. Algorithm Interview: Level Order Traversal of Binary Tree
  4. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  5. Binary Tree Level with Minimum Sum
  6. Sorting a list with 3 unique numbers
  7. Daily Interview Problem: Merge Overlapping Intervals
  8. [Daily Problem] Add two numbers as a linked list
  9. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  10. [Daily Problem] Remove k-th Last Element From Linked List

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: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />