Using Map Solved below given Program
Problem 1: Two Sum Description: 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.
Sample Input 1: nums = [2, 7, 11, 15], target = 9 Sample Output 1: [0, 1] (Because nums[0] + nums[1] == 9)
Sample Input 2: nums = [3, 2, 4], target = 6 Sample Output 2: [1, 2] (Because nums[1] + nums[2] == 6)