hash table
![[LeetCode] 217. Contains Duplicate](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FmwwHJ%2FbtrKuvhKKyb%2FAAAAAAAAAAAAAAAAAAAAALTcerKcTc2uw_mLiEoOTKBlBQWr3iY_9YEcTfiZNvwD%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D%252FdxsmZRuiHZ2%252FmDk6tbBs3ODax0%253D)
[LeetCode] 217. Contains Duplicate
*알고리즘 스터디에 참여하면서 Blind 75 LeetCode Questions 목록에 있는 문제를 풀이합니다. 문제: https://leetcode.com/problems/contains-duplicate/ Contains Duplicate - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이: class Solution: def containsDuplicate(self, nums: List[int]) -> bool: # Sol 1 -- O(n) # dist..
![[LeetCode] 1. Two Sum](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbE1skj%2FbtrJ74cNIvl%2FAAAAAAAAAAAAAAAAAAAAANhBv0BceZTVV-fJgjY117w38LDcJPEZvl6UsAnwNo1T%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DyZJPt4IYYwKnoRSQRPFBkjVAQAQ%253D)
[LeetCode] 1. Two Sum
*알고리즘 스터디에 참여하면서 Blind 75 LeetCode Questions 목록에 있는 문제를 풀이합니다. 문제: https://leetcode.com/problems/two-sum/ Two Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이: class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: nums_dic = {} # Stores the dictionary..