---
title: "Discussion on \"Leetcode 2540. Minimum Common Value\" | Hashnode"
description: "Discussion on \"Leetcode 2540. Minimum Common Value\". Intuition\nSince both arrays are sorted, we can find the minimum common value by iterating from left to right with two pointers.\nApproach\nInitialize both pointers to 0 to start at the beginning of the array. While both pointers are within bounds of th..."
url: "https://hashnode.com/posts/leetcode-2540-minimum-common-value/65ec87cc04713cf000d1a158"
---

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

Discussion

# [Leetcode 2540. Minimum Common Value](https://blog.kennycarneal.com/leetcode-2540-minimum-common-value?utm_source=hashnode&utm_medium=feed)

Intuition Since both arrays are sorted, we can find the minimum common value by iterating from left to right with two pointers. Approach Initialize both pointers to 0 to start at the beginning of the array. While both pointers are within bounds of th...

Mar 9, 2024 · 2 min read · blog.kennycarneal.com  
Read the article

-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[Kenny Carneal](https://hashnode.com/@Frawsty)

@Frawsty · Nashville, Tennessee

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

Christ follower, rollerblader, gamer, developer

I am a developer from Nashville, TN. I specialize in the .NET tech stack. I have created many projects in Blazor WASM, Xamarin, MAUI, etc.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
