---
title: "Discussion on \"4. Median of Two Sorted Arrays: From intuitive to optimized(Java, Hard)\" | Hashnode"
description: "Discussion on \"4. Median of Two Sorted Arrays: From intuitive to optimized(Java, Hard)\". From O(m+n) to O(log(n)) using binary search"
url: "https://hashnode.com/posts/4-median-of-two-sorted-arrays-from-intuitive-to-optimizedjava-hard/686b249c02c6a66b10059386"
---

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

Discussion

# [4\. Median of Two Sorted Arrays: From intuitive to optimized(Java, Hard)](https://huanganni.hashnode.dev/4-median-of-two-sorted-arrays-from-intuitive-to-optimizedjava-hard?utm_source=hashnode&utm_medium=feed)

From O(m+n) to O(log(n)) using binary search

Jul 7, 2025 · 6 min read · huanganni.hashnode.dev  
Read the article

-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#java](https://hashnode.com/tag/java)
-   [#leetcodehard](https://hashnode.com/tag/leetcodehard)
-   [#binary-search](https://hashnode.com/tag/binary-search)

## Written by

[Anni Huang](https://hashnode.com/@HuangAnni)

@HuangAnni · Singapore

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

LLM Training Operation Specialist @ ByteDance | Ex-Master of IT in Business (AI track) at SMU

I’m Anni Huang, an AI researcher-in-training currently at ByteDance, specializing in LLM training operations with a coding focus. I bridge the gap between engineering execution and model performance, ensuring the quality, reliability, and timely delivery of large-scale training projects.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
