Data Structures in Javascript ( Merge Sort Algorithm ) | Frontend DSA Interview Questions

#javascriptinterviewquestions #datastructures #datastructuresandalgorithms

In this DSA with JS video, we will understand one of the most asked Sorting Algorithm - Merge Sort in Javascript.
This is the most Entertaining and Knowledge Packed Data Structures and Algorithms in Javascript Interview Course on Youtube !

➡️ Download my DSA with JS E-Book -

🟪 Follow me on Instagram and u will clear your interview 🤓 -

➡️ Source Code -

🔗 Complete Data Structures and Algorithms with JS Course -

🔗 Arrays Video -

🔗 Javascript Interview Playlist -

🔗 Frontend Machine Coding Interview Series -

🔗 Cars24 Interview Experience -

🔗 Unacademy Interview Experience -

🔗 Tazorpay Interview Experience -

🔗 MERN Stack Tutorial with Redux -

🔗 React Beginner's Project Tutorials -

-------------------------------------------------------------------------

00:00 Intro
00:11 Visual Explanation - Merge Sort
04:51 Download my DSA E-Book
05:15 Merge Sort Implementation
09:28 Time and Space Complexity of Merge Sort
10:20 Interview Question on Merge Sort
10:33 Ques - Merge Intervals
12:18 Solution
18:37 Outro

-------------------------------------------------------------------------

Special Thanks to our members -

[minutesbibletruth]

I have followed you for a very long time and I have learn't a lot

[minutesbibletruth]

I really like the content u producing here. It makes your channel unique keep up with the good work for us

[sukhpreet]

EAGERLY Waiting for the video on
Classes
Design Patterns
And interview questions on above.

[aditya.agrawal]

Hi @RoadsideCoder, you must subtract 1 from the mid after getting floor value as the array index starts from 0. Thanks.

[sarthaksharma]

Great video as always, but I'm confused about why the time complexity of the merge function comes out to be O(n). Since we are doing a shift operation inside the while loop, won't it be O(n^2)? Imagine while loop running for n times (it'll run for x times, where x is the minimum of the lengths of 2 arrays that we are merging), and then for each of that iteration, along with a simple push operation (which completes in O(1), we are also doing two shifts, which are completed in O(n)), so won't the complexity of the merge function turn out to be O(n^2) with this approach?

[jp_flicks]

Hey Piyush, I downloaded your E-book but I am unable to open it, I don't know what is the file type, but it's not getting opened.

[tarundurbha]

Plz let us know whether your DSA sheet contains the answers as well or not

[ChandujobsApplications]

bro you should not use inbuilt functions for interviews