Have you ever wondered what is meant by Dynamic Programming?

Well The idea is to simply store the results of subproblems, so that we do not have to re-compute them when needed later. This simple optimization reduces time complexities from exponential to polynomial.

Sounds interesting? Want to learn more?

Then don’t miss our “Introduction To Dynamic Programming” session this Sunday at 8Pm with our speaker Muhammed Magdi.