Sir It would be good if you could record the stream in a better quality. Even after doing 720p It was blurry ,Don't know why. Rest explanation was good sir👍
your time complexity precompute => 4*10^4*log(200) => 2 * 10^7 dp logic => 8* 10^6 overall => approx(10^8) Instead of doing precompute every time, do it once and use it for every testcase. like this check whether gcd[1][1] is 0 or not, if it is 0 then do precompute else do nothing hope you get clarification :)
Please fill the Feedback form for PCD: forms.gle/sDJyhjRfHhrihh7L6
Thanks brother, crystal clear
You're welcome
Sir It would be good if you could record the stream in a better quality.
Even after doing 720p It was blurry ,Don't know why.
Rest explanation was good sir👍
I had selected the highest possible resolution. But looks like it's still a little blurry.
I think there is no use of newCnt[j+1] = add(newCnt[j+1], cnt[j]); in for loop
already we handling it in outside
is this crct ??
❤❤
can 2nd be solved in O(log N) time?
What's your logic?
you look like kalpit veerval
🙄
Why is this giving TLE for the 3rd question.
class Solution {
void precomputeGCDs(vector &gcd) {
for (int i = 0; i
your time complexity precompute => 4*10^4*log(200) => 2 * 10^7
dp logic => 8* 10^6
overall => approx(10^8)
Instead of doing precompute every time, do it once and use it for every testcase.
like this
check whether gcd[1][1] is 0 or not, if it is 0 then do precompute else do nothing
hope you get clarification :)
and one more, instead of making gcd vector local variable, make it class variable
code khud se likho bro
mtlb?