Added: LeetCode solution for Two Sum

[sasi-upparapalli]

Two Sum

Problem:
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Approach:
Use a hash map (dictionary) to store visited numbers and their indices. For each element, check if the complement (target - current number) exists in the map. If yes, return the indices.

Time Complexity: O(n)
Space Complexity: O(n)

Difficulty Level: Easy
Tags: Array, Hash Map

Contributor: sasi-upparapalli

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!

[uday1646]

Good sasi kanth

[sasi-upparapalli]

Hello! 👋

This is my first Hacktoberfest contribution, adding a solution for the Two Sum problem with a clear explanation and README update. I would greatly appreciate it if you could take a moment to review this pull request. Please let me know if any improvements or changes are needed.

Thank you very much for your time and for maintaining such a valuable repository!

Best regards,
sasi-upparapalli