Merge Intervals | Love Babbar DSA Sheet Q14 | Arrays | Leetcode 56

✅ Useful Links
𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - / codingwithprakash
𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaAC...
𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - / prakash-shukla
SUBSCRIBE AND HIT BELL ICON TO CHECK MORE OF MY CONTENT
czcams.com/users/PrakashShuklaVideo...
Merge Intervals | Love Babbar DSA Sheet Q14 | Arrays
𝐌𝐔𝐒𝐈𝐂 𝐂𝐑𝐄𝐃𝐈𝐓
Track: Julius Dreisig & Zeus X Crona - Invisible [NCS Release]
Music provided by NoCopyrightSounds.
Watch: • Julius Dreisig & Zeus ...
Free Download / Stream: ncs.io/InvisibleYCheckout Complete Crash Course at prakashshukla.com

[@CodingWithPrakash_]

✅ Useful Links
𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/
𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44
𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

[@ganpatsisodiya4507]

Aap ye kaise sikhe ?
Aap konsi company me kam karte ho ?
Please reply my 2 question bhaiya

[@CodingWithPrakash_]

Padhai krke sikha
Mera background linkedin pe dekho

[@hardikchaturvedi8036]

you are doing great job ,please keep making such great content

[@prakashsingh1107]

Apki videos sbse jyda smjgh aati h.......sbse achi trh smjhate h aap bhai......Thanks

[@CodingWithPrakash_]

Thanks

[@babishushma]

samajh aa gaya preakash bhaiya thanks keep it up👍👍

[@ritwikrajpoot9751]

Great explanation !!

[@StevenRor]

Nice Explanation 👍👍

[@sumitmishra848]

Great explanation !!! The way you explain solution is incredible.

[@CodingWithPrakash_]

Wait for my new tree playlist

[@harshthakur9890]

thank you sir.

[@ganpatsisodiya4507]

Mujhe sirf aapka hi samjaya samaj aata h
keep going bhaiya

[@CodingWithPrakash_]

Wow

[@RahulSingh-ze8mk]

nicely explained!!

[@killerDevil3763]

simply i want to say that u have sound explainatiion skills, u r requested please make all vedios like this by animations presentation. it is very usie full to understand code better. bhai ese hi animation k through samaj me acha aata h. thank u for that

[@factswithabhi27]

Great soln bro

[@Shadowxgaming_]

nicely explained bhaiya

[@tanvitripathi5743]

Keep it up👍👍

[@pranavkorhale5089]

very nice content

[@sharuk3545]

good explanation

[@AbhishekSingh-vl1dp]

nicely explain !!

[@CodingWithPrakash_]

Glad you liked it!

[@tarundhiman5011]

best video on youtube

[@CodingWithPrakash_]

Glad you think so ..

[@terminator96]

Sir can u explain the use of the funcn u used to sort in some more detail

[@CodingWithPrakash_]

U can learn insertion sort to understand that and more optimize is merge sort

[@dilipsuthar4206]

Rock

[@brainrelaxing6895]

Can u please tell how to write interval coordinate. I mean full code with coordinates

[@satyanarayanmohanty3415]

Great upload.

[@abhishekranjan1094]

That's great sir...You look old in the photo but in reality you are looking very young in the video 😅

[@CodingWithPrakash_]

My age 30

[@arpitsatnalika]

Can you make a video for this question: 1477. Find Two Non-overlapping Sub-arrays Each With Target Sum

[@CodingWithPrakash_]

Will try

[@ANURAGSINGHBCG]

Hindi me swaad aa jata hai

[@ridhigarg8613]

I am having error in leet code.
class Solution {
public int[][] merge(int[][] intervals) {
Arrays.sort(intervals,(a,b)-> Integer.compare(a[0],b[0]));
Stack stack=new Stack();
stack.add(intervals[0]);

for(int i=1;istartpoint2)
{
int[] merge= new int[] {startpoint1,max};
stack.add(merge);
}
else
{
stack.add(poparray);
stack.add(intervals[i]);
}

}
int[][] output=new int[stack.size()][2];
for(int i=output.length-1;i>=0;i--)
{
int[] poparray=stack.pop();
output[i][0]=poparray[0];
output[i][1]=poparray[1];
}
return output;
}
}please can someone check and see

[@janibasha8932]

it should be if(endpoint1>=startpoint2)