This is a project that displays Levenshtien Distance Problem, implemented using Dynamic Programming. This is done using HTML, CSS and JavaScript and a descent front-end where there are two input fields and the output shows the minimum number of single character edits required to change one word into the other