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

Related Articles

  1. Longest Substring Without Repeating Characters
  2. A trick for getting good at coding interviews FASTER
  3. Print a tree level-by-level, with line-breaks
  4. Daily Interview Problem: Maximum Profit From Stocks
  5. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  6. Algorithm Interview: Permutations of numbers
  7. Daily Interview Question: Find Cycles in a Graph
  8. Daily Interview Question: Create a Simple Calculator
  9. Daily Interview Problem: Deepest Node in a Binary Tree
  10. Design Tic-Tac-Toe

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