관심있는것들

Check If a String Contains All Binary Codes of Size K

https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/ class Solution: def hashAllCodes(self, s: str, k: int) -> bool: codeSet = set() for i in range(len(s) -k + 1): codeSet.add(s[i:i + k]) return len(codeSet) == 2 ** kA naive approach would be to iterate over the string for each given binary combination. But instead, we can use a ..

23) 테이블 파티셔닝

보호되어 있는 글입니다.

Insert Delete GetRandom O(1)

https://leetcode.com/problems/insert-delete-getrandom-o1/ class RandomizedSet: def __init__(self): self.numMap = {} self.numList = [] def insert(self, val: int) -> bool: res = val not in self.numMap if res: self.numMap[val] = len(self.numList) self.numList.append(val) return res def remove(self, val: int) -> bool: res = val..

Repeated DNA Sequences

https://leetcode.com/problems/repeated-dna-sequences/class Solution: def findRepeatedDnaSequences(self, s: str) -> List[str]: seen, res = set(), set() for l in range(len(s) - 9): cur = s[l: l+10] if cur in seen: res.add(cur) else: seen.add(cur) return list(res)10개의 substring이 set에있는지 쭉 확인하면서 given string itera..

21) Join Update & Join Delete

보호되어 있는 글입니다.

보호되어 있는 글입니다.