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

Related Articles

  1. Algorithm Interview: Convert Roman Numerals to Decimal
  2. Skip the readings, focus on problems. And use all the hints!
  3. Daily Interview Problem: Deepest Node in a Binary Tree
  4. Algorithm Interview: Maximum Path Sum in Binary Tree
  5. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  6. CPU Utilization
  7. Daily Interview Problem: Circle of Chained Words
  8. Algorithm Interview: String Compression
  9. Daily Interview Question: Find Cycles in a Graph
  10. Print a tree level-by-level, with line-breaks

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