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
- binary search
- Binary
- Depth-first Search
- backtracking
- list
- 쉬움
- sorting
- tree
- Medium
- two pointers
- 이진트리
- linked list
- 문자열
- 재귀
- string
- Python
- leetcode
- DP
- HashTable
- recursive
- 미디움
- math
- dfs
- binary tree
- 중간
- matrix
- easy
- hash table
Archives
- Today
- Total
목록gray code (1)
부부의 코딩 성장 일기
LeetCode 89(Gray Code, Python)
1. 문제 링크 https://leetcode.com/problems/gray-code/description/ Gray Code - LeetCode Can you solve this real interview question? Gray Code - An n-bit gray code sequence is a sequence of 2n integers where: * Every integer is in the inclusive range [0, 2n - 1], * The first integer is 0, * An integer appears no more than once in the sequence, leetcode.com 2. 문제 설명 n-bit gray code sequence는 아래 조건을 만족하..
Algorithm/LeetCode
2024. 1. 20. 19:00