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

Related Articles

  1. ImageMagick Vulnerabilities -  CVE-2016–3714
  2. Detect Linked List Cycle
  3. Daily Interview Puzzle: Intersection of Linked Lists
  4. A trick for getting good at coding interviews FASTER
  5. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  6. First and Last Indices of an Element in a Sorted Array
  7. Daily Interview Problem: Sort Colors
  8. Find Missing Numbers in an Array
  9. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  10. Daily Interview Problem: Maximum Profit From Stocks

Comments (0)

    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="index, follow">