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

Related Articles

  1. Daily Interview Problem: Count Number of Unival Subtrees
  2. Autorun.inf Virus Protection
  3. Algorithm Interview: Shifted String
  4. Staying on a Chess Board
  5. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  6. Generate All IP Addresses
  7. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  8. [Daily Problem] Longest Palindromic Substring
  9. Daily Interview Problem: Maximum Profit From Stocks
  10. Spreadsheet Columns

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />