Solved Two-Sum Problem from LeetCode

[Dhavisco]

Solution - Two Sum Problem using C++ from LeetCode

This solution is implemented in C++. The following steps are taken to solve the problem:

1. Create and initialize an unordered_map called numberToIndex to store elements as keys and their corresponding indices as values.
2. Create an empty vector called result to store the resulting indices.
3. Iterate through the elements of the input vector 'numbers':
   • Calculate the complement by subtracting the current number from the target.
   • Check if the complement is already in the 'numberToIndex' map using numberToIndex.find(complement).
4. If the complement is found:
   • Add the indices of the two numbers to the 'result' vector: the index of the complement (from the map) and the current index.
   • Return the 'result' vector and exit the function.
5. If the complement is not found:
   • Add the current number and its index to the 'numberToIndex' map.
6. If no solution is found after the entire loop, return an empty 'result' vector.

#12

[iamdestinychild]

great, everything looks good #12

[Dhavisco]

great, everything looks good #12

Thank you. :)
Up to the next one.