Merge Sorted Array | Leetcode 88

Merge Sorted Array
Leetcode problem number 88
JAVA interview programming playlist:
• Interview Programming ...
Git Repo:

[@thAsciNileshPal]

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

[@pragmaticcoder6910]

Your explanations are much better than LeetCode Editorial solutions. Thanks !

[@name-sn6]

bro im new to this and i didnt understand anything , how to begin learning

[@jopaslona1]

Thank you very much! I finally understood how to solve this problem without creating new array

[@diproy9363]

To the point and simple! awesome explanation.

[@sauryakumargupta3008]

Outstanding explanation in such a ez way

[@beesettiswathi7162]

great explanation mam..thank you so much

[@krushnachandrajena6297]

can you share your git repo.

[@SayanBanikAuthor]

Very Nice Video! Thanks Ma'am

[@shivraj940]

Mam, only 6 problems there in Top 150 interview category. Please complete this section

[@BlendBox]

Thank you so much 🙏

[@YoonMilling]

Thank you!

[@Adarsh_Pradhan]

found this channel today keep making videos like this best of luck friend

[@nammi-dahiya]

Thanks mam apke solution se maine DSA ke bhut ache ache concepts sikha paya

[@melk48111]

Your videos are great. Thank you

[@chaithanyack]

how we are taking i=m-1; i dont understand that particular part

[@mohsinbehzad8993]

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...

[@upunaireshakeerawella7776]

Awesome thanks

[@bhargavasai5557]

Thank you ma'am

[@ec072nikitavishwakarma7]

Thankyou ❤

[@athravnigadikar4925]

Plz mam can u teach how to implement hashmap and other collection things in problems detail video so many students gets confusing in that

[@AshishKumar-od3pr]

Why are we using 0,0,0 in the end of nums1, since arrays are mutable?

[@syedrizwan2203]

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.

[@AshishKumar-od3pr]

@@syedrizwan2203 thanks bro

[@technologiesmotivationd7754]

Hi mam your explanation is very easy so please can you make leet code video in java please mam

[@user-bi8qz3mr6t]

mam ek doubt h ki apne loop start karte time j>=0 ki place pr i>=0 kyu nhi likha ???

[@courtneyadjoa246]

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.

[@sahilali2514]

Ma'am please solve other interview questions...your explanations are very good.Thankyou🤗

[@TechnosageLearning]

Hi..Will continue leetcode questions series very soon..Please stay tuned.. Thanks!

[@SayanBanikAuthor]

7:05

[@mdayazalam3132]

Mam please upload the video on Leetcode problem no- 238. Product of Array Except Self

[@TechnosageLearning]

Hi..Please wait for some time..Will upload soon

[@mdayazalam3132]

@@TechnosageLearning ok mam

[@user-uo7by6hh1h]

god level explanation

[@Rob-J-BJJ]

thank you it worked fine

[@padmavatishah9922]

great expplanation.

[@movieshots2135]

there is solution better than this just add nums2[] elements in the nums1[] array and sort them

[@mrf8795]

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?

[@mursalin3698]

just keep grinding.

[@humanityrush]

Keep practicing easy lvl problems and build that confidence!

[@mrf8795]

@@humanityrush thanks for your advice.

[@slowedReverbJunction]

Cute kitni hai ye ❤

[@11csepratikshaargulewar71]

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

[@bibhutibaibhavbora8770]

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

[@irfanahmad9761]

Hi, pls continue this series. #addicted

[@lovegarg5061]

This code is fail when m=0

[@TechnosageLearning]

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

[@infinity2creation551]

Yes its failing check again didi

[@Rob-J-BJJ]

it works for me

[@bhargavchandhu5100]

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); } }

[@disrespect12]

class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int count=0; for(int i=m;i