| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 |
Tags
- Generator
- attribute
- LeetCode
- Python Code
- 프로그래머스
- 컴퓨터의 구조
- 715. Range Module
- 43. Multiply Strings
- kaggle
- concurrency
- 밴픽
- Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- shiba
- 30. Substring with Concatenation of All Words
- 315. Count of Smaller Numbers After Self
- t1
- iterator
- 운영체제
- Python
- 파이썬
- DWG
- Python Implementation
- 109. Convert Sorted List to Binary Search Tree
- Decorator
- Class
- Protocol
- 시바견
- data science
- Regular Expression
Archives
- Today
- Total
목록find (1)
Scribbling
LeetCode: 839. Similar String Groups
크게 두 단계로 풀 수 있다. 1) 알파벳 조합이 동일한 집합끼리 나눈다. 2) 각 집합 내에서 단어를 연결하고, 소 집합의 갯수를 구한다. This prob can be solved within two steps. 1) Group words by alphabet combinations 2) Connect words in each group and then get the number of small groups Code is quite straightforward, so I guess there's no need to explain more. Time complexity would be (O(N**2*k)), where N is the number of words and k is length of a w..
Computer Science/Algorithms & Data Structures
2022. 5. 25. 10:46