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

Related Articles

  1. Number of Ways to Climb Stairs
  2. [Daily Problem] Course Prerequisites
  3. ImageMagick Vulnerabilities -  CVE-2016–3714
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  6. Find Pythagorean Triplets
  7. Patterns for breaking down questions you haven
  8. 56 Bytes
  9. Daily Interview Problem: Reverse Words in a String
  10. Skip the readings, focus on problems. And use all the hints!

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