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

Related Articles

  1. Daily Interview Problem: 3 Sum
  2. Algorithm Interview: Subarray With Target Sum
  3. Daily Interview Puzzle: Falling Dominoes
  4. Daily Interview Question: Word Search
  5. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  6. [Daily Problem] Remove k-th Last Element From Linked List
  7. Daily Interview Puzzle: Minimum Size Subarray Sum
  8. Floor and Ceiling of a Binary Search Tree
  9. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  10. Daily Interview Problem: Contiguous Subarray with Maximum Sum

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