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
- math
- 미디움
- matrix
- 중간
- 이진트리
- 리트코드
- Depth-first Search
- Medium
- binary search
- easy
- 쉬움
- Python
- list
- 문자열
- hash table
- leetcode
- sorting
- 재귀
- binary tree
- two pointers
- DP
- dfs
- Array
- HashTable
- recursive
- linked list
- Binary
- tree
- string
- backtracking
Archives
- Today
- Total
목록leetcode 31 (1)
부부의 코딩 성장 일기
LeetCode 31(Next Permutation, Python)
1. 문제 링크 LeetCode - The World's Leading Online Programming Learning Platform Next Permutation - LeetCode Can you solve this real interview question? Next Permutation - A permutation of an array of integers is an arrangement of its members into a sequence or linear order. * For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], leetcode.com 2. 문제 설명 주어진 수를 한 번씩 사용..
Algorithm/LeetCode
2023. 12. 24. 19:00