mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-09-24 15:00:31 +08:00
chore: sync content to repo (#9860)
Co-authored-by: kamranahmedse <4921183+kamranahmedse@users.noreply.github.com>
This commit is contained in:
co-authored by
kamranahmedse
parent
9fbb43b859
commit
6e07cdb282
@@ -0,0 +1,7 @@
|
||||
# Two Sum
|
||||
|
||||
The Two Sum problem asks you to find two numbers within an array that, when added together, equal a specific target value. You are typically given an array of integers and a target integer. The goal is to return the indices of the two numbers that sum up to the target. It's often assumed that each input array will have exactly one solution, and you cannot use the same element twice.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@official@Two Sum](https://leetcode.com/problems/two-sum/description/)
|
||||
Reference in New Issue
Block a user