Minimum Time to Finish the Race | Leetcode 2188 | Contest 282 | DP | Knapsack problem 🔥🔥

[@himanshuchhikara4918]

amazing explanation

[@CodeWithSunchitDudeja]

Bhai Amazon k baad bhi... Kya baat hai

[@hemantvardani1436]

Really great question, great explanation !!!!

[@daljeetsingh2566]

Great Solution bro!

[@botron1187]

Bro, i was pulling my hair to solve this problem and you are amazing bro.... thanks you so much for such a great explication

[@CodeWithSunchitDudeja]

You are most welcome

[@Venkatesh54629]

@@CodeWithSunchitDudeja Could you please explain we what exactly we are doing in Math.Min(dp[i], dp[j] + changeTime + dp[i - j])

[@MrHotfish88]

Amazing explanation🤯 thanks bro!🔥

[@written_syntax]

🔥🔥

[@theghostwhowalk]

Thanks. With reference to formula on line 26, Dp[i] = min time to complete I+1 lapse right? When we change tire at j location, Why we have dp[j] + dp[i-j]+..

[@eprohoda]

beautiful ~ taek care, =)

[@avdd80]

I'm struggling with Knapsack problems. Can you please point me to a couple of your past videos where you explain solutions to knapsack problems in detail?

[@hoyinli7462]

same here. I have been watching this channel for quite a long time but I can't remember knapsack skills.

[@hoyinli7462]

kzbin.info/www/bejne/ip6ZpZlvoLejb5I I guess this is the one. But is there more videos?

[@CodeWithSunchitDudeja]

Thanks for sharing there is one more video kzbin.info/www/bejne/bpywoXaFntqUmMU

[@nehagupta-op7si]

I think dp[i] = Minimum time to complete i loops instead of minimum time to complete ith loop

[@amritanshu83]

Could you please explain if (timeToCompleteLaps >2 ^17) break;

[@hoyinli7462]

how about the time complexity? You used double loop from 1-1000. So the time complexity should be O(n^2) (n = numLaps)?

[@CodeWithSunchitDudeja]

yes

[@amritanshu83]

Since we know we must change tyre in 18th lap could you please explain: dp[i]=i

[@ShubhamGupta-qk9uq]

More of a solution than explaination, please take some time to explain intuition even if you think it is obvious. Thanks

[@bgmilover9784]

@Coding Decoded bro, i got everything but i am not clear about what exactly we are doing at line 26 (dp[i] = Math.Min(dp[i], dp[j] + changeTime + dp[i - j]);) could you please explain me this?

[@jianpengyu9843]

Nice explanation, but I don't quite understand nochange array. What happens if I stick with tire A for 3 laps and then change to tire B and stick with tire B for 4 laps?

[@gauravkungwani]

till 5:00 you are only explaining the question, in a 11: 00 min video. Bro who comes to see the solution for this, has already understood the question. After that it is good. Try avoiding it.

[@CodeWithSunchitDudeja]

Yes, I can reduce on this time but I do it explicitly so that all are on same page.

[@blenderbottle382]

I don’t think I fully understood the withoutChange array. What does it represent? What does the ith index in that array mean?