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, 17700 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, 17700 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: Max and Min with Limited Comparisons
  2. [Daily Problem] Add two numbers as a linked list
  3. Daily Interview Problem: Arithmetic Binary Tree
  4. Algorithm Interview: No Adjacent Repeating Characters
  5. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  6. Daily Interview Puzzle: Intersection of Linked Lists
  7. Daily Interview Problem: Distribute Bonuses
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Non-decreasing Array with Single Modification
  10. First and Last Indices of an Element in a Sorted Array

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

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