Title: Implement Two Sum Algorithm #59
Description
Initiative (Required)
GSSoC 2024 Extd 🚀
Is your feature request related to a problem? Please describe.
Implement a function to solve the "Two Sum" problem. Given an array of integers (nums) and an integer (target), the goal is to return the indices of two numbers from the array such that their sum equals the target.
You must assume that:
Each input will have exactly one solution.
The same element cannot be used twice.
The result can be returned in any order.
Example Input/Output:
Example 1:
Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Describe the solution you'd like.
Solution for the described problem.
Add any other context or screenshots about the feature request here.
contributing under hactoberfest'24 and gssoc'24 ext