in above example, m is equal to 3, means 3rd position. But the index in Array starts from 0 and position starts from 1. So (i =m-1) means that In above example, when the position is 3 then the index will be 2. That is the reason that we subtract 1 from the position of Array to get the index. Hope u understand...
arrays are fixed in nature if you don't initialised it with 0s what you will put there other than zero to make it size of m i.e 6 here 2nd thing if you use scanner class also arrays will get initialised with zeros only for int values.
kyunki humko second array se hi compare karna hai na.... aur resultant changes i variable ko represent karte hai . aur humne final result bhi wahin store karna hai.
dear sister, I am unable to catch the coding logic without seeing the code in video or other tutorial but i understand what to do but cant implement the code .this giving me much stress, I am a beginner .I have solved 9 easy problem but in every problem i have to take help..what should i do?where should i focus on.can I be a good programmer?
Cause both are already sorted and it will increase the time complexity of the solution, first you will put each element in the array then start using any of the sorting algorithm
Didi you don't explain why we have to place i, j or k pointers at that position only 😢 . Why can't we start our pointers from somewhere else . You should explain also as it will help with thought process
it is best and simple than above class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { for (int j = 0, i = m; j < n; j++) { nums1[i] = nums2[j]; i++; } Arrays.sort(nums1); } }
Hi.. The code will not fail..As mentioned in the problem, m=0 means there are no elements in the nums 1 arrays so the output would be all elements of nums2 array.. Please try the code..I have tried and submItted ,it's working fine
Your explanations are much better than LeetCode Editorial solutions. Thanks !
bro im new to this and i didnt understand anything , how to begin learning
@@somaynaik06 what you did't understand here ?
Thank you very much! I finally understood how to solve this problem without creating new array
Thanks for explaining this question so well, I have just started with LC and your videos are helpful
To the point and simple! awesome explanation.
keep it up didiiiii ; U and SashCode channel doing great job ; i request u too pls come up with the series of daily leetcode potd solutionss
Mam, only 6 problems there in Top 150 interview category. Please complete this section
Why you started arranging elements from last is it because of zeros.?
Can you explain the Time and space complexity in this program?
found this channel today keep making videos like this best of luck friend
Outstanding explanation in such a ez way
great explanation mam..thank you so much
how we are taking i=m-1; i dont understand that particular part
in above example, m is equal to 3, means 3rd position. But the index in Array starts from 0 and position starts from 1. So (i =m-1) means that In above example, when the position is 3 then the index will be 2. That is the reason that we subtract 1 from the position of Array to get the index. Hope u understand...
@@mohsinbehzad8993 good explanation.
Thanks mam apke solution se maine DSA ke bhut ache ache concepts sikha paya
Ma'am please solve other interview questions...your explanations are very good.Thankyou🤗
Hi..Will continue leetcode questions series very soon..Please stay tuned..
Thanks!
Why are we using 0,0,0 in the end of nums1, since arrays are mutable?
arrays are fixed in nature if you don't initialised it with 0s what you will put there other than zero to make it size of m i.e 6 here
2nd thing if you use scanner class also arrays will get initialised with zeros only for int values.
@@syedrizwan2203 thanks bro
Very Nice Video! Thanks Ma'am
ye numbers swap nai kerne honge?
can you share your git repo.
plz start again this series
mam ek doubt h
ki apne loop start karte time j>=0 ki place pr i>=0 kyu nhi likha ???
kyunki humko second array se hi compare karna hai na.... aur resultant changes i variable ko represent karte hai .
aur humne final result bhi wahin store karna hai.
Thank you so much 🙏
Your videos are great. Thank you
dear sister, I am unable to catch the coding logic without seeing the code in video or other tutorial but i understand what to do but cant implement the code .this giving me much stress, I am a beginner .I have solved 9 easy problem but in every problem i have to take help..what should i do?where should i focus on.can I be a good programmer?
just keep grinding.
Keep practicing easy lvl problems and build that confidence!
@@humanityrush thanks for your advice.
Why not just put the nums2 inside nums1 and sort the array ? wouldn't that be much easier ?
Cause both are already sorted and it will increase the time complexity of the solution, first you will put each element in the array then start using any of the sorting algorithm
Plz mam can u teach how to implement hashmap and other collection things in problems detail video so many students gets confusing in that
Thank you ma'am
Hi mam
your explanation is very easy so please can you make leet code video in java please mam
god level explanation
Mam please upload the video on Leetcode problem no- 238. Product of Array Except Self
Hi..Please wait for some time..Will upload soon
@@TechnosageLearning ok mam
thank you, mam.
Thankyou ❤
pls upload more videos
nice
Thank you!
Awesome thanks
great expplanation.
thank you it worked fine
7:05
Didi you don't explain why we have to place i, j or k pointers at that position only 😢 . Why can't we start our pointers from somewhere else . You should explain also as it will help with thought process
Because we are starting from some specific point that is num1 and nums2 places because these arrays are sorted already. We can't randomly put pointers
because since we put i or j into the k we should move forward which means - -
there is solution better than this just add nums2[] elements in the nums1[] array and sort them
Cute kitni hai ye ❤
it is best and simple than above
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
for (int j = 0, i = m; j < n; j++) {
nums1[i] = nums2[j];
i++;
}
Arrays.sort(nums1);
}
}
Hi, pls continue this series. #addicted
This code is fail when m=0
Hi..
The code will not fail..As mentioned in the problem, m=0 means there are no elements in the nums 1 arrays so the output would be all elements of nums2 array..
Please try the code..I have tried and submItted ,it's working fine
Yes its failing check again didi
it works for me
Yes it is not working
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int count=0;
for(int i=m;i