We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
the recursive relation for LCS can naturally be translated to an iterative non-recursive algorithm for successively filling up the memo table of subproblem answers. That can be done with a simple C-style double nested for loop, and doesn't require defining external functions or fancy lambdas / functors.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Magic Spells
You are viewing a single comment's thread. Return to all comments →
the recursive relation for LCS can naturally be translated to an iterative non-recursive algorithm for successively filling up the memo table of subproblem answers. That can be done with a simple C-style double nested for loop, and doesn't require defining external functions or fancy lambdas / functors.