Overlapping sub-problems — Tabulation

Karthik Kalyanaraman
May 31 · 4 min read

In this article, we are going to learn the most basic and fundamental technique of Dynamic Programming(DP) called Tabulation or bottoms-up approach.

Any large computer science problem can be broken down into smaller sub-problems. These sub-problems can be independently solved and composed to get to the solution of the main problem.