Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

Cpp Program Code:

The twoSum function takes an input vector nums and an integer target as arguments. It then iterates through the vector and checks whether the complement of each element (i.e., the difference between target and the current element) is already in a hash map. If it is, the function returns the indices of the current element and its complement. Otherwise, the current element is added to the hash map.

The main function creates an example input vector and target, calls the twoSum function, and prints the resulting indices to the console.

Note that this implementation assumes that the input vector has at least two elements and that there is only one solution to the problem. If these assumptions do not hold, the function may need to be modified accordingly.

Python Program code: