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

Related Articles

  1. Algorithm Interview: Shifted String
  2. Longest Substring Without Repeating Characters
  3. First and Last Indices of an Element in a Sorted Array
  4. Daily Interview Question: Word Search
  5. Daily Interview Problem: Longest Substring With K Distinct Characters
  6. Reverse a Directed Graph
  7. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  8. Daily Interview Problem: Spiral Traversal of Grid
  9. Find the non-duplicate number
  10. Daily Interview Problem: Look and Say Sequence

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