ASMR Programming - LeetCode Competitive Programming - No Talking

Median of Two Sorted Arrays solved!
The code used in this program is already explained here:
Merge Sort in Python: • [1.6] Merge Sort Algor...
🔗Important Links:
Data Structures in Python: • Data Structures in Python
LeetCode Problem Link: leetcode.com/p...
🌐Join our community:
Android App(Notes+Videos): play.google.co... Facebook: / thinkxacademy Twitter: / thinkxacademy Instagram: / thinkxacademy
#asmrprogramming #asmr #programming

[@zeinmukhanov2481]

Wait, isn’t it O(max(n,m)) as you are traversing both arrays while populating new one with elements from both nums1 and nums2?

[@9thchord]

Nice one!!