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

Related Articles

  1. Spectrum Master
  2. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  3. Daily Interview Problem: Queue Using Two Stacks
  4. Sort a Partially Sorted List
  5. [Daily Problem] Longest Palindromic Substring
  6. Daily Interview Problem: Find the Number of Islands
  7. Algorithm Interview: Shifted String
  8. [Daily Problem] Longest Increasing Subsequence
  9. Daily Interview Problem: Spiral Traversal of Grid
  10. Algorithm Interview Question: H-Index

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