Hi guys,

I've read about edit distance problem. Studying this Wikipedia article. It's described one variation problem "one of which takes two strings and a maximum edit distance s, and returns min(s, d)". But i don't understand idea to solve it. Can somebody help me to understand it: "It achieves this by only computing and storing a part of the dynamic programming table around its diagonal."???

Thanks alot for help.