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

Related Articles

  1. Two-Sum
  2. Maximum In A Stack
  3. A trick for getting good at coding interviews FASTER
  4. Daily Interview Problem: Find the Number of Islands
  5. Daily Interview Problem: Circle of Chained Words
  6. Daily Interview Problem: Spiral Traversal of Grid
  7. Algorithm Interview: Determine If Linked List is Palindrome
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. Daily Interview Problem: Distribute Bonuses
  10. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree

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