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

Related Articles

  1. Daily Interview Problem: Queue Using Two Stacks
  2. [Daily Problem] Witness of The Tall People
  3. Floor and Ceiling of a Binary Search Tree
  4. A trick for getting good at coding interviews FASTER
  5. Algorithm Interview Question: Symmetric k-ary Tree
  6. Algorithm Interview: Determine If Linked List is Palindrome
  7. Daily Interview Problem:Create a balanced binary search tree
  8. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  9. [Daily Problem] Add two numbers as a linked list
  10. Design Tic-Tac-Toe

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