**Problem**

[Original Link]

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have

*exactly*one solution, and you may not use the*same*element twice.
Example:

Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

Solution:

The idea is to maintain a hash map to store the elements that you have seen as we iterate over the array. For every number we try to see if we have a complement i.e (target-current no) in our hash map. If we find the number in our hash map, we have our answer.

Space Complexity: O(n)

Time Complexity: O(n)

Nice stuff, which you have shared here about the Software Engineering firm Calgary. this information very important for person who are interested in. If anyone looking for software company.

ReplyDeleteAmazing Article,Really useful information to all So, I hope you will share more information to be check and share here.

ReplyDeleteinplant training

inplant training chennai

inplant training meaning

inplant training certificate

inplant training report

report for inplant training

inplant training certificate format

inplant training meaning in tamil

what is inplant training

inplant training in chennai for mechanical

This is one of the most incredible blogs Ive read in a very long time.

ReplyDeleteđặt vé máy bay đi anh

giá vé máy bay tết sài gòn thanh hóa

giờ bay đà lạt đi đà nẵng

từ sài gòn đi cam ranh bao nhiêu tiếng

giá vé máy bay khứ hồi hà nội phú quốc