---
title: "Discussion on \"Median of Two Sorted Arrays - Leetcode 4\" | Hashnode"
description: "Discussion on \"Median of Two Sorted Arrays - Leetcode 4\". Problem - Leetcode\nGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.\nThe overall run time complexity should be O(log (m+n)).\nExample 1:\nInput: nums1 = [1,3], nums2 = [2]\nOutput: 2.00000\n..."
url: "https://hashnode.com/posts/leetcode-0004/659abba448de03295ff990d7"
---

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

Discussion

# [Median of Two Sorted Arrays - Leetcode 4](https://jyotirmoy.hashnode.dev/leetcode-0004?utm_source=hashnode&utm_medium=feed)

Problem - Leetcode 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)). Example 1: Input: nums1 = \[1,3\], nums2 = \[2\] Output: 2.00000 ...

Jan 7, 2024 · 3 min read · jyotirmoy.hashnode.dev  
Read the article

-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#go](https://hashnode.com/tag/go)

## Written by

[Jyotirmoy Barman](https://hashnode.com/@jyotirmoydotdev)

@jyotirmoydotdev · Tura, Meghalaya

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

Developer

I'm a developer who loves to write. I started my blog because I wanted to share my knowledge and passion for technology with others. I write about a variety of topics, including coding, web development, and blockchain.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.