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

Related Articles

  1. Algorithm Interview: Level Order Traversal of Binary Tree
  2. Daily Interview Problem: Full Binary Tree
  3. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  4. CPU Utilization
  5. Algorithm Interview: Maximum Path Sum in Binary Tree
  6. Daily Interview Problem: Reverse Words in a String
  7. Daily Interview Problem: Trapping Rainwater
  8. Compare Version Numbers
  9. Daily Interview Problem: Maximum Profit From Stocks
  10. Staying on a Chess Board

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