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

Related Articles

  1. Print a tree level-by-level, with line-breaks
  2. Daily Interview Problem: Merge K Sorted Linked Lists
  3. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  4. [Daily Problem] Longest Increasing Subsequence
  5. Find Missing Numbers in an Array
  6. Floor and Ceiling of a Binary Search Tree
  7. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  8. Daily Interview Problem: Product of Array Except Self
  9. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  10. Daily Interview Problem: Reverse Integer

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