CA 04 - Two Sum & Sorted Two Sum

1. Two Sum

Solved

Easy

Topics

Companies

Hint

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]
Explanation: 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]

 

Constraints:

• 2 <= nums.length <= 104
• -109 <= nums[i] <= 109
• -109 <= target <= 109
• Only one valid answer exists.

 

SOLUTION:

class Solution:

    def twoSum(self, nums: List[int], target: int) -> List[int]:

        n=len(nums)

        for i in range(n):

            for j in range(i+1,n):

                if nums[i]+nums[j] == target:

                    return(i,j)

 

EXPLANATION: This is a basic indexing and searching operation in linear method.Assigning two different

index pointers i and j using for loop