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
- binary search
- binary tree
- string
- 재귀
- 이진트리
- 문자열
- Depth-first Search
- tree
- 쉬움
- 리트코드
- two pointers
- leetcode
- Medium
- 미디움
- Array
- easy
- HashTable
- dfs
- matrix
- DP
- hash table
- math
- Binary
- backtracking
- recursive
- Python
- 중간
- list
- linked list
- sorting
Archives
- Today
- Total
목록leetcode 96 (1)
부부의 코딩 성장 일기
LeetCode 96(Unique Binary Search Trees, Python)
1. 문제 링크 https://leetcode.com/problems/unique-binary-search-trees/description/ Unique Binary Search Trees - LeetCode Can you solve this real interview question? Unique Binary Search Trees - Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. Example 1: [https://assets.leetcode leetcode.com 2. 문제 설명 정수 n이..
Algorithm/LeetCode
2024. 2. 8. 19:00