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

Related Articles

  1. Algorithm Interview: Convert Roman Numerals to Decimal
  2. Design Tic-Tac-Toe
  3. Algorithm Interview: Make the Largest Number
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. Daily Interview Problem: Merge List Of Number Into Ranges
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. [Daily Problem] Longest Increasing Subsequence
  8. Daily Interview Problem: 3 Sum
  9. Algorithm Interview: Level Order Traversal of Binary Tree
  10. [Daily Problem] Remove Consecutive Nodes that Sum to 0

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="index, follow">