Leetcode # 1. Two Sum

https://leetcode.com/problems/two-sum/

Solution

class Solution:
  def twoSum(self, nums: List[int], target: int) -> List[int]:
    checked_nums = {}
    for i, num in enumerate(nums):
      if target - num not in checked_nums.keys():
        checked_nums[num] = i
        continue
      return [checked_nums[target - num], i]

Last Updated on 2023/08/16 by A1go