Day 2 of LeetCode
Documenting Leetcode solving.
Q1
1. Two Sum
Easy. Array
Use a hashmap to store items value and index ({value: index}). Check if the difference of the target and current item is in the hashmap.
class Solution:
def twoSum(self, nums: List[int], tar...
evelynsjourney.hashnode.dev1 min read