this is standarad problem in geek for geeks.i am unable to think dynamic approach.please help me.
box ke uper box rkhna ha.
Box Stacking Problem
@SOHAN
Do you know about longest increasing subsequence? try to think in the lines of longest increasing subsequence.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.