dsa-competitive-programming/leetcode/lc4/notes.md

The brute force approach is quite intuitive but doesnt meet the specified Run time complexity of O(log(m+n)) instead takes O((m+n)log(m+n)) taken by sorting

TwoPointer method takes O(n+m) where we only merge till half and then extract the median which is the middle element

Yet to learn binarySearch approach