Good Explanation. Building the intuition is the main task while learning Problem Solving which people leave. It sometimes even helps in other unsolved questions we encounter. Thanks for making this an integral part of your videos.
Instead of storing the numbers, we can use index of element picked from second array as second parameter and -1 for not picking the element, dp[index][par2+1]
Yup that's what I thought too. This can be much better especially for languages where the HashMap is significantly more expensive than a normal array, like in Rust.
it will not work, as we are replacing the value from arr2, how will you know you have replaced the value from arr2 and not taken the arr1 prev value, in the next call stack, so he is taking the actual value itself.
just one suggestion instead of explaining direct dp solution, first explain the recursive solution and then move to dp optimized solution so it will become more easy and simple to understand
Thanks for the awesome explanation. However, I have a small question regarding the TC. The TC mentioned in the video is n*m*logm. Basically n*m means, we are pairing every number of arr1 with every number of arr2. But that is not the case. For each index of arr1, we are simply searching the ceil num from arr2. Shouldn't the TC be N*logM. Am I missing something here. Please Help!!
I just sometimes open your vedio thinking that this will be better than previous , but you are not a good teacher i think so , may be if you do some less overacting and give more effort on explaining the solution ,it may work it's seem like you are explaining it to yourself .
Code & Notes: drive.google.com/file/d/1EK8hg01qgQezdNMw3Txhu6MJakSKfRjK/view?usp=sharing
Amazing one, would learn 4 concepts together 🙈
Good Explanation. Building the intuition is the main task while learning Problem Solving which people leave. It sometimes even helps in other unsolved questions we encounter. Thanks for making this an integral part of your videos.
Bro the energy❤❤
12:10 🥲
bro you are an absolute genius! Thanks a lot everyone knows but explaining it so that everyone can understand is just so great.
No words 🔥🔥
what an amazing problem and solution bro, thanks so much
Best explanation bro 👍
Instead of storing the numbers, we can use index of element picked from second array as second parameter and -1 for not picking the element, dp[index][par2+1]
Yup that's what I thought too. This can be much better especially for languages where the HashMap is significantly more expensive than a normal array, like in Rust.
it will not work, as we are replacing the value from arr2, how will you know you have replaced the value from arr2 and not taken the arr1 prev value, in the next call stack, so he is taking the actual value itself.
Using of map as dp is the part I was unable to figure out. Thanks for the solution.
This is the best video Solution for this problem !! Great work
just one suggestion instead of explaining direct dp solution, first explain the recursive solution and then move to dp optimized solution so it will become more easy and simple to understand
why couldnt we use unordered_map ?
for the pair type you have to use map not unordered_map
one suggestion can you code when you explain so which more understandable Thank you for this awesome explanation :)
thanks bro! very well explained.
🤯🤯🤯🤯🤯🤯
Just wow ! Day 11 streak and still going thanks to you
Bro can you tell me some more questions on trinary serch???
No one can match his way of explanation.....
Hey, This was really an awesome explanation. Keep up the great work!!
❤ best
That was an incredible video!
Thanks for the awesome explanation. However, I have a small question regarding the TC. The TC mentioned in the video is n*m*logm. Basically n*m means, we are pairing every number of arr1 with every number of arr2. But that is not the case. For each index of arr1, we are simply searching the ceil num from arr2. Shouldn't the TC be N*logM. Am I missing something here. Please Help!!
nice explanation!!!
Hey Aryan!! Can you explain why you have added 1 in second if of help function. intmax vala jisme smjhaya tha
I dont understand how did the array change [1,5,3,6,7] and [1,5,3,7?,8?] @13:29
Awesome explanation bro❤
Can anyone provide me the java version of this working code
Java code for all vedio bhaiya please 🥺
I just sometimes open your vedio thinking that this will be better than previous , but you are not a good teacher i think so ,
may be if you do some less overacting and give more effort on explaining the solution ,it may work
it's seem like you are explaining it to yourself .