search

Algo-Phantoms / Algo-Tree

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
MIT License
363 stars 618 forks source link

Edit distance [GSSOC'21] #1018

Open Mugdha-Hazra opened 3 years ago

Mugdha-Hazra commented 3 years ago

Edit distance

This algorithm finds the minimum number of edits that are required to convert string1 to string2. Edit here means either insert, remove or replace. The algorithm implemented here uses dynamic programming.

Time complexity

O(M*N), where M and N are the lengths of the two strings.

Space complexity

O(M*N), where M and N are the lengths of the two strings.

Hello @anubhavitis @dheerajkotwani @tarun26091999 @avijit1999 @todi-2000 sir, I wanted to add this important question in the Algo-Tree/string/ and I will start working on it as soon as I get assigned!! as I am a part of GSSoC'21, so I would like to implement this in CPP.

tanyalava commented 3 years ago

I would really like to work on this issue . I am well aware of the topic and its time and space complexity and will try to write a clean code with all the comments and test cases included in C++. Please assign this to me.

shubhidua commented 3 years ago

I would like to contribute to the above problem in java as I am a participant of GSSOC'21. Kindly assign this to me.