The xplanation is too good sis.. I've been watching several videos of yours and have got better understanding of approach.. I guess there is no need for the loop.... while(i>=0){ nums1[k--] = nums1[i--]; } Since, it belongs to the nums1 array we can leave it as it is... Thank You sis 💓
Best way of explanation. Whenever I have doubts on LeetCode problem, I come here and find solution with great explanation. Thank you for this much efforts.💕💕
I think we can skip the while loop for i>=0 after while(i>=0 && j>=0) . Just we can make the while loop for j>=0 . This will be sufficient. Please correct me if i am wrong?
then it will take more time complexity of O(n) + O( (n+m) log (n+m) ) . first one is for adding n values to m and second is for ssorting the array of size (n+m).
Please continue these sessions, your explanation is totally understandable ♥️
Thanks Subarno, sure 😊
The xplanation is too good sis.. I've been watching several videos of yours and have got better understanding of approach..
I guess there is no need for the loop....
while(i>=0){
nums1[k--] = nums1[i--];
}
Since, it belongs to the nums1 array we can leave it as it is...
Thank You sis 💓
Perfect Code. thanks
Welcome Paawan :)
Best way of explanation. Whenever I have doubts on LeetCode problem, I come here and find solution with great explanation. Thank you for this much efforts.💕💕
Thank you so much Paridhi, means a lot 🥲 😊🙌🏻
Thank you didi approch dekha tha bas baki code khud se kara and chal gaya...love you didi..❤❤
Welcome Shubham 🙌🏻🤗
for (int i = 0; i < n; ++i) {
nums1[m + i] = nums2[i];
}
Arrays.sort(nums1);
}
//it's simply like this
time complexity nlogn zyada ho raha h iss approach mein...that's why the second approach explained above is better
maam kya aap one on one session leskte ho , i am confused alot kuch pta nhi chal rha ek guidaince chahiye , pls maam , i am currently in 6th sem .
ua-cam.com/video/C4oBXLr3zos/v-deo.html
Go to coding ninjas ..
Again great explanation
Thank you 😊
Hey I just spent 40 minutes on this problem, it is marked as EASY but the logic is very significant here
got confused whether to study or listen your voice...it too sweet..Khair pdhai pe focus krte...
ohh, is it 😅
I am 9 years experienced learning from you
my pleasure :)
Great work i was known to first approach but i learned the second one thank you so much......
welcome, glad you liked it :)
your voice is just awesom ...i love your voice...i just listen you for hours...
Thank you so much 😀
Your explanation is best😊👍💯.
thank you :)
Thank you , was confused but you cleared my doubts
thank you, glad it was helpful :)
Please continue this way to teaching us.
Thanks Rajan, sure 🤗
What hardware do you use to draw on computer?
It's Microsoft Whiteboard with some license
External mouse and Microsoft whiteboard is software :)
You are the only one who could make me understand. Thank you ♥♥♥
thank you, glad it was helpful :)
Great explanation didi ❤️
Thanks a lot 😊
Best explanation. It is very easy to understand your explanation. Thanks a lot .
Welcome Avinash, glad it was helpful :)
Thank you so much for this wonderful explanation. You made it too easy to understand this complex topic.
Thanks Amit 🥹😊 glad it was helpful
If the nums2 array is completed(j
yess :)
Thank you. Ayushi. This was super smooth
thank you, glad it was helpful :)
nice explanation
Thanks 😊
love your videos, continue making them!
Thank you! Will do! :)
great video, thank you
Glad you liked it!
the elements are not automatically enter in the next array
Brilliant explanation ❤
Thanks Manan :)
Thanks didi
Welcome Niraj, glad it was helpful 😊
I think we can skip the while loop for i>=0 after while(i>=0 && j>=0) . Just we can make the while loop for j>=0 . This will be sufficient. Please correct me if i am wrong?
No, the thing here is if elements remain in any of the two arrays and 1 array is finished,
then we need to check both separately after loop ends.
very great explanation
😊 thank you
Very Nice 👏👏
Thank you Shobhit :)
mam your video help me thank you mam
it company me degree matter karati hai ?
thanks explaining very well pls if possible do in python as well
sure, will keep that in mind, thank you :)
Thank you so much ... ur eplanation is awesome
Thanks Harish ❤️
Nice explanation.💯
Well done
thank you, glad it was helpful :)
Thankyou now this ques is clear
thank you, glad it was helpful :)
I understand the approach , technique acha hai
but sare testcases pass nahi hue leetcode me es solution se
Nice explanation di, Please continue to explain more problems.
Thanks Govind :)
nyc explanation, and how to get approach like yours, let me know please
thank you :)
Practice, Practice, Practice :)
very good explanation ....thanks
Welcome Rishav , glad it was helpful 😊
thanks didi....for this nice explanation🤗
Welcome Sathi, glad it was helpful 😊
Amazing videos
thank you, glad it was helpful :)
how do we get such intuition during coding test ?
Why not to add other arrays values at the end and sort the array?
then it will take more time complexity of O(n) + O( (n+m) log (n+m) ) . first one is for adding n values to m and second is for ssorting the array of size (n+m).
Best explanation
Thanks 😊
This was great, easy to understand.
Thank you Saurabh 😊
Thank u mam ❤❤
Most welcome 😊
only 1 test case i.e., case 2 is passed ......... please recheck
I think in the first explaination there should be a mention that nums1[i]
getting time exceeded error in leet code
submit nahi ho pa raha hai answer
Thank you🙌
Welcome 🤗
thik h but video k length jyda bada nhi hai ?
di plz tell me which graphic tablet you use plz its a humbel request plz plz plz plz plz
Hi, I use external mouse 😅
only 42/59 testcases passed
❤
runtime error
omg i can't stand here. Great video
very good explanation and approach
thank you
keep it up👍👍
So nice of you, thanks 🤩🤗
maine aapka same code try kiya phir bhi nahi hua 😔
yr test case change krdiye honge, jab video bnayi hogi, to pkka chal rha hoga :)
thanku mam
Welcome, glad it was helpful :)
for [1,2,3,0,0,0] length was supposes to be 6 why it is 3
M value is 3 , meaning only 3 elements from start are of nums 1
mam aap ho sake to hindi me video bana sake lot help for other student