"""
_________________________1. Two Sum_________________________
Difficulty: Easy		Likes: 22357		Dislikes: 760		Solution: Available
Total Accepted: 4.5M		Total Submission: 9.6M		Acceptance Rate: 47.2%
Tags:  Array, Hash Table


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]
     2 <= nums.length <= 104 -109 <= nums[i] <= 109 -109 <= target <= 109 Only one valid answer exists.
    Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

"""


import functools, itertools, operator, bisect, array, collections 
from typing import * 

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


if __name__ == "__main__":
	pass


"""
similarQuestions::
		3Sum: Medium
		4Sum: Medium
		Two Sum II - Input array is sorted: Easy
		Two Sum III - Data structure design: Easy
		Subarray Sum Equals K: Medium
		Two Sum IV - Input is a BST: Easy
		Two Sum Less Than K: Easy
		Max Number of K-Sum Pairs: Medium
		Count Good Meals: Medium
"""
