add Levinstein distance with Dynamic Programming: up -> down approach

[alexpantyukhin]

Describe your change:

Levinstein distance with Dynamic Programming: up -> down approach. some tests are copied from https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/edit_distance.py#L61 .

• [x] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Documentation change?

Checklist:

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized.
• [x] I know that pull requests will not be merged if they fail the automated tests.
• [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x] All new Python files are placed inside an existing directory.
• [x] All filenames are in all lowercase characters with no spaces or dashes.
• [x] All functions and variable names follow Python naming conventions.
• [x] All function parameters and return values are annotated with Python type hints.
• [x] All functions have doctests that pass the automated testing.
• [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• [x] If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[alexpantyukhin]

The task: #7171

[alexpantyukhin]

There is an inner function in the implementation. It doesn't requires tests, because outer function is tested.

[alexpantyukhin]

@Kush1101 could you please review this PR