#1 Two Sum | Ultimate Leetcode Challenge
Problem Statement - 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. You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
Only one valid answer exists.
Link to the problem --- https://leetcode.com/problems/two-sum/
To know more about STL find --- https://en.cppreference.com/w/cpp/alg...
Also checkout my playlist on Coding Interview Problems --- • Easiest Coding Interview Problem Ever.
#timeenthusiast #ultimateleetcodechallenge #leetcodeinhindi