Competitive Programming
前往频道在 Telegram
Solving competitive Programming Questions one day at a time. Group link: https://t.me/daily1interviewprogram Please forward it to your friends
显示更多未指定国家未指定类别
4 553
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Hope you guys have solved todays question. Click on the below link to know the solution. Please write your solution in the comment section of the post. As this is the first post, there are some things to be taken care of, will improve the redability in upcoming posts.
https://www.prodevelopertutorial.com/given-an-array-of-integers-in-ascending-order-return-index-of-the-two-numbers-such-that-they-add-up-to-a-specific-key-provided/
Todays Question:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Explanation:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
Difficulty:
Easy
Asked in company:
facebook, Bloomberg
