Edit distance | Dynamic programming | Google interview question | Amazon interview question

Published: 27 June 2021
on channel: Aishwarya M

Problem Statement:
Given two strings str1 and str2 and below operations that can performed on str1. Find minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.
Insert
Remove
Replace
All of the above operations are of equal cost.

Audio track: From mixkit
Title: Raising me higher
by Ahjay Stelino

Reference: Fundamentals of computer algorithms by Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran

On this page of the site you can watch the video online Edit distance | Dynamic programming | Google interview question | Amazon interview question with a duration of hours minute second in good quality, which was uploaded by the user Aishwarya M 27 June 2021, share the link with friends and acquaintances, this video has already been watched 77 times on youtube and it was liked by like viewers. Enjoy your viewing!

17,888

128