| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 | 29 | 30 | 31 |
Tags
- Python Implementation
- 30. Substring with Concatenation of All Words
- 315. Count of Smaller Numbers After Self
- 715. Range Module
- Class
- Regular Expression
- 프로그래머스
- Substring with Concatenation of All Words
- attribute
- Convert Sorted List to Binary Search Tree
- Python Code
- concurrency
- t1
- 109. Convert Sorted List to Binary Search Tree
- 파이썬
- LeetCode
- kaggle
- Generator
- 컴퓨터의 구조
- Decorator
- 시바견
- shiba
- data science
- 43. Multiply Strings
- 운영체제
- 밴픽
- Protocol
- Python
- DWG
- iterator
Archives
- Today
- Total
목록287. Find the Duplicate Number (1)
Scribbling
LeetCode: 287. Find the Duplicate Number
As a novice, it was not easy at all for me to solve this problem. I relied on other people's explanations and codes, and this post is to summarize their ideas. It is very tricky to solve this problem within O(N) time & O(1) memory. (* without modifying the array) The best way is "Floyd's Algorithm" as this problem can be seen as a linked list with a cycle. Check out the below video for further e..
Computer Science/Coding Test
2021. 12. 28. 20:35