Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- backtracking
- 중간
- Medium
- Binary
- 미디움
- linked list
- 문자열
- binary tree
- 리트코드
- Python
- Array
- DP
- easy
- 쉬움
- list
- dfs
- math
- HashTable
- matrix
- Depth-first Search
- leetcode
- tree
- 이진트리
- binary search
- 재귀
- recursive
- sorting
- string
- two pointers
- hash table
Archives
- Today
- Total
목록2024/01/29 (1)
부부의 코딩 성장 일기
LeetCode 82(Remove Duplicates from Sorted List II)
1. 문제 링크 https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/ Partition List - LeetCode Can you solve this real interview question? Partition List - Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the no leetcode.com 2. 문제 설명 정렬된..
Algorithm/LeetCode
2024. 1. 29. 19:00