"Median of two sorted Arrays": A Google Software Engineering Interview Question PART 1

Link to Patreon Account: / forallepsilon
1:05 - 3:38 What is a Median, and how to calculate it
3:50 - 5:34 Naive Solution
5:35 - 6:46 Problem with the Naive Solution
6:47 - 10:00 Linear Time Solution Using Merge Operation
10:01 - 11:37 Variation of Problem Technique
11:30 - 23:18 Explanation of Optimal Solution
This is part 1 of the "Median of two sorted arrays" problem. This problem used to get asked in software engineering interviews for companies such as Google, Microsoft, Apple, and Dropbox to name a few. In my opinion, I think its an excellent indicator of who is able to think slowly, and critically about problems and is an excellent problem for software engineering interviews.
If you like the video, please consider liking it and subscribing to the channel. Making these videos needs a tremendous amount of effort and time, so I appreciate all the support I get.