Doubt in Minimum steb bottom down

#1

doubt in code sir firstly create a loop then write
for(inti=2;i<=n;i++)
if(n%3==0){
op1=dp[i/3]
}
my doubt is that why dont we directly write op1=dp[n/3];
as it is bottom down then dp[n/3 ] have its value

#2

According to the question, it is given that we need to check if our n is divisible by 3 then only option 1 is valid, thats why we are checking for it in Bottom Up DP also.
I think this was your doubt, because your desciption is little bit unclear, so you are asking anything else then please tell it.

#3

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.

#4

helllo @Royal_Yashasvi

u have reopned the doubt. what issue u r facing now?

#5

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.