---
title: "Discussion on \"Problem 167. Two Sum II [Medium]\" | Hashnode"
description: "Discussion on \"Problem 167. Two Sum II [Medium]\". Description\nGiven a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index<sub>1</sub>] and numbers[index<sub>2</s..."
url: "https://hashnode.com/posts/problem-167-two-sum-ii-medium/685a1b90ced96660bb9eef1e"
---

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

Discussion

# [Problem 167. Two Sum II \[Medium\]](https://learncodedaily.hashnode.dev/problem-167-two-sum-ii-medium?utm_source=hashnode&utm_medium=feed)

Description Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers\[index<sub>1</sub>\] and numbers\[index<sub>2</s...

Jun 24, 2025 · 1 min read · learncodedaily.hashnode.dev  
Read the article

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

## Written by

[Michael Peattie](https://hashnode.com/@physics2comp)

@physics2comp

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.