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

Related Articles

  1. Algorithm Interview: Permutations of numbers
  2. Skip the readings, focus on problems. And use all the hints!
  3. Daily Interview Question: Find Cycles in a Graph
  4. Daily Interview Problem: 3 Sum
  5. Plus One
  6. [Daily Problem] Witness of The Tall People
  7. [Daily Problem] Angles of a Clock
  8. Staying on a Chess Board
  9. Daily Interview Problem: Count Number of Unival Subtrees
  10. Daily Interview Problem:Create a balanced binary search 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" />