Two Sum Problem

[Sneha421]

Problem Statement: Given an array and a target sum, find a pair of numbers from the array that add up to the target sum.
Assume that not more than one such pair exists in the given array.

Input: Array and a Target sum
Output: The pair that adds up to the target sum

There is always exactly one solution

[Sneha421]

This problem has three ways different approaches

Two for loops --> O(n^2) time | O(1) space
HashMap --> O(n) time | O(n) space
Two pointers --> O(n) time | O(1) space

I have previously worked on all three approaches and would like to work on them yet again for this repository

[AshishG97]

please assign this issue to me

[susheel-kumar-1998]

I would like to contribute to this issue using hashmap in java.

[maleeshasilva]

can you please asign me?

[sakshi-tiwari670]

I can do this using HashMap as well as Two pointer algorithm. I would love to work on this . Please assign this to me

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!