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

Related Articles

  1. Daily Interview Question: Create a Simple Calculator
  2. Daily Interview Problem: Reverse Integer
  3. Algorithm Interview: Permutations of numbers
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. Daily Interview Question: Longest Sequence with Two Unique Numbers
  6. Daily Interview Problem: 3 Sum
  7. Reverse a Linked List
  8. Daily Interview Problem: Queue Using Two Stacks
  9. Daily Interview Problem: Validate Binary Search Tree
  10. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image

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