Yesterday after a whole day of volunteering to a certain annual IT event, we had our lecture on dynamic programming. We specifically tackled the usual Fibonacci sequence and binomial coefficients. Those few topics were relatively easier than the next problems; edit distance, least common subsequence, least increasing subsequence among others.
Those topics blew my mind. I was lost at the first part of edit distance. Since it was sort of a laddered discussion in which knowledge of the previous topic is required to understand the next topic, I wasn’t able to follow the entire discussion.
I think I need to read and reread the book again and again.
Post a Comment