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
- Array
- 리트코드
- sorting
- dfs
- 쉬움
- Depth-first Search
- Python
- string
- backtracking
- 재귀
- binary search
- easy
- 이진트리
- hash table
- HashTable
- binary tree
- leetcode
- Medium
- math
- Binary
- list
- tree
- 중간
- two pointers
- recursive
- 미디움
- DP
- 문자열
- matrix
- linked list
Archives
- Today
- Total
목록Leetcode 40 (1)
부부의 코딩 성장 일기
LeetCode 40(Combination Sum II, Python)
1. 문제 링크 https://leetcode.com/problems/combination-sum-ii/ Combination Sum II - LeetCode Can you solve this real interview question? Combination Sum II - Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. Each number in candid leetcode.com 2. 문제 설명 기존 Combination Sum(Leetcode39)의..
Algorithm/LeetCode
2023. 12. 31. 19:00