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

Related Articles

  1. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  2. Algorithm Interview Question: H-Index
  3. Most Frequent Subtree Sum
  4. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  5. Sorting a list with 3 unique numbers
  6. Spreadsheet Column Title
  7. Making a Height Balanced Binary Search Tree
  8. [Daily Problem] Add two numbers as a linked list
  9. Algorithm Interview: No Adjacent Repeating Characters
  10. Daily Interview Problem: Jump to the End

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