Box Stacking Problem – Dynamic Programmming The Box Stacking problem is a variation of LIS problem. We need to build a maximum height stack.
box stacking problem
2 Articles
2
Maximum Length Chain of Pairs – Dynamic Programming – The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.