+**Optimal Substructure** is a property of problems where an optimal solution to the overall problem can be constructed from optimal solutions to its subproblems. This characteristic is a cornerstone of algorithms like [Dynamic Programming](/wiki/dynamic_programming) and [Divide and Conquer](/wiki/divide_conquer), ensuring efficiency by reusing optimal results from smaller components.
+## See also
+- [Recursion](/wiki/recursion)
+- [Algorithm](/wiki/algorithm)
+- [Greedy Algorithm](/wiki/greedy_algorithm)
... 1 more lines