Two Sum Solution for Cognizant
Company: Cognizant · Difficulty: Easy · Topics: Array, Hash Table, Two Pointers
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.
Examples
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]
Explanation: Because nums[1] + nums[2] == 6, we return [1, 2].
Approach
Use a hash table to store numbers and their indices for O(n) time complexity.
Time and Space Complexity
- Time Complexity: O(n)
- Space Complexity: O(n)