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
- math
- binary search
- two pointers
- leetcode
- Depth-first Search
- 이진트리
- list
- binary tree
- Binary
- 쉬움
- Python
- Medium
- tree
- 미디움
- 문자열
- 중간
- HashTable
- hash table
- Array
- matrix
- dfs
- recursive
- 리트코드
- linked list
- easy
- sorting
- 재귀
- DP
- string
Archives
- Today
- Total
목록leetcode 19 (1)
부부의 코딩 성장 일기
LeetCode 19(Remove Nth Node From End of List, Python)
1. 문제 링크 https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Remove Nth Node From End of List - LeetCode Can you solve this real interview question? Remove Nth Node From End of List - Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: [https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg] leetcode.com 2. 문제 설명 연결 리스트..
Algorithm/LeetCode
2023. 12. 18. 19:00