Skip to content

This is a problem which is asked to solve in my Data Structure & Algorithm Lab.

Notifications You must be signed in to change notification settings

MAOMislive/Edit_distance_count

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 

Repository files navigation

forthebadge made-with-java
Given two strings string1 and string2 and we have to perform operations on string1. Find minimum number of edits (operations) required to convert ‘string1 ’ into ‘string2’.

We can do these three operation:

  1. Insert a character at any position of the string.
  2. Remove any character from the string.
  3. Replace any character from the string with any other character.

Now, modify your offline code to consider the following costs for each operation:

  • Insert : 1
  • Remove: 1
  • Replace: 2

Finally, print the total cost to convert String1 to String2.

About

This is a problem which is asked to solve in my Data Structure & Algorithm Lab.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages