L -28 Median of two Sorted Arrays | Leetcode | Java plus DSA Placement | FAANG

Contest Name: June Code Challenge With Shashwat
Rules:
1. Day1 : Create a LinkedIn or Twitter Post mentioning that you are participating in this challenge and use the hashtag #junecodechallengewithshashwat and tag me.
LinkedIn Id: @shashwattiwari1999
Twitter Id: @shashwatt89
2. Comment on each of the 30 videos in 30 days.
Example:
Day 1 Completed on first video,
Day 2 Completed on second video.
.
.
.
Day 30 Completed on 30th Video.
3. Day 11 and Day 21: make a LinkedIn and twitter post mentioning your progress in the challenge, you can share your learnings. (don't forget to tag me and use the hashtag mentioned.)
4. Day 30: Create a post mentioning that you completed this challenge!
Prize: 1 Lucky winner will get mechanical keyboard.
June code challenge with shashwat playlist:
• June Code Challenge wi...
....................................................................................................................................................
In this lecture, we will study about programming language, its type and memory management.
Topics covered:
1.Median of two sorted arrays
Java Plus DSA Placement Course:
• Java and DSA Course Pl...
Notes:
github.com/Tiwarishashwat/Jav...
Telegram Link:
shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding​​ #problemsolving​ leetcode, ​hackerrank,​ hackerearth, codechef,​ codesignal,​ algorithms,​ javaprogramming,​ sde,​ placement, programming, programming language, java, dsa, coding, memory management, java plus dsa placement course,
coding, programming, programmer, python, developer, code, javascript, coder, computerscience, technology, java, codinglife, html, webdeveloper, tech, webdevelopment, css, software, webdesign, softwaredeveloper, linux, programmers, softwareengineer, php, programmingmemes, machinelearning, programminglife, pythonprogramming, codingisfun, java plus dsa, java, dsa, faang, interview questions, placement course, learn in the best way

[@amolgawai010]

Superb Bro🤩🤩

[@shashwatdadhich1808]

Exccellent Explanation!! Thank you

[@PiyushSharma-we8yd]

You teaching has given me confidence to crack any dsa round now...

[@manishkumar-uw5mw]

Nice content 💯. Thankyou...

[@abhijitmanna4524]

It took me 2.5 hours to understand this solution and write the code, understood my patience level and thinking of this problem. Loved it

[@kunalsarpal7564]

same bro but samaj lag gya

[@avinash6692]

1st view 🙌🙌

[@kunalagarwal1581]

most underrated video..Hats off🔥🔥

[@shashwat_tiwari_st]

Underrated hurts 😪

[@utkarshsharma5202]

Why we take end = n1 and not n1 - 1 because we are taking start = 0 as from 0 to n1 there are n + 1 element and in all searching problem we take low as 0 and high as n - 1?

[@vanshdhaka8534]

very well explained!

[@AmarjeetKumar-en1gk]

Best explanation of this problem on youtube.

[@utkarshsharma5202]

Why we take end = n1 and not n1 - 1 because we are taking start = 0 as from 0 to n1 there are n + 1 element and in all searching problem we take low as 0 and high as n - 1?

[@avinashkumar8058]

Thanks bhaiya ❤️❤️❤️

[@yogeshsahni5808]

so beatuful so elegant

[@OIAOa]

I Understood clearly bhaiya.....
Pls continue problems on each topic.❤

[@shashwat_tiwari_st]

Yes on 12th September, Oops series will be dropped, after that I will start uploading 2 pointers approach problems followed by all Advanced concepts

[@user-lx7hd4ji8o]

Day 11 challenge completed #junecodechallengewithshashwat

[@Priyew]

Day 11 completed #junecodechallengewithshashwat

[@avigoels]

Amazing

[@Nagar2024]

Thankuuu for this crystal clear expalination bhaiyaaaaaaaaaaaa🥳🎉 !

[@shashwat_tiwari_st]

🙌

[@utkarshsharma5202]

Why we take end = n1 and not n1 - 1 because we are taking start = 0 as from 0 to n1 there are n + 1 element and in all searching problem we take low as 0 and high as n - 1?

[@RohitJain-ls2ov]

consider,
nums1 = [101]
nums2 = [100]
if we take end = n1 - 1, then we will get wrong answer, since while loop will be exited after first iteration

[@gourvigupta4991]

mera to submit nii hora ye code

[@shashwat_tiwari_st]

code is working maine check kra hai, May be kuch miss ho gya hoo aapse, video ke description me code hai, check again,