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

Related Articles

  1. [Daily Problem] Validate Balanced Parentheses
  2. Daily Interview Question: Create a Simple Calculator
  3. Daily Interview Problem: Count Number of Unival Subtrees
  4. Generate All IP Addresses
  5. Algorithm Interview Question: Symmetric k-ary Tree
  6. Daily Interview Problem: Largest BST in a Binary Tree
  7. Algorithm Interview: No Adjacent Repeating Characters
  8. Find the non-duplicate number
  9. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  10. CPU Utilization

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