---
title: "Discussion on \"Median of Two Sorted Arrays\" | Hashnode"
description: "Discussion on \"Median of Two Sorted Arrays\". 🧠 Problem\nMedian of Two Sorted Arrays\nGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). \n🏷️ Tags\narray, binary search, divide an..."
url: "https://hashnode.com/posts/median-of-two-sorted-arrays-1-1-1/688d20be2d3d7df77dac5da8"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Median of Two Sorted Arrays](https://releetcode.hashnode.dev/median-of-two-sorted-arrays-1-1-1?utm_source=hashnode&utm_medium=feed)

🧠 Problem Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 🏷️ Tags array, binary search, divide an...

Aug 1, 2025 · 1 min read · releetcode.hashnode.dev  
Read the article

-   [#array](https://hashnode.com/tag/array)
-   [#binary-search](https://hashnode.com/tag/binary-search)
-   [#divide-and-conquer](https://hashnode.com/tag/divide-and-conquer)

## Written by

[RedAurther](https://hashnode.com/@RedAurther)

@RedAurther

  
[View profile](https://hashnode.com/@RedAurther)

Nothing is fun

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
