-
### LeetCode Username
code_bug53
### Problem Number, Title, and Link
796. Rotate String https://leetcode.com/problems/rotate-string/description/
### Bug Category
Missing test case *(Incorrect/Ine…
-
> 我是傻逼
-
给定一个二叉树，找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
**说明:** 叶子节点是指没有子节点的节点。
**示例：**
给定二叉树 `[3,9,20,null,null,15,7]` ，
3
/ \
9 20
/ \
15 7
返回它的最大深度 3…
-
### LeetCode Username
ASK
### Problem Number, Title, and Link
63. Unique Paths II https://leetcode.com/problems/unique-paths-ii/
### Bug Category
Missing test case *(Incorrect/Inefficient Code ge…
-
### LeetCode Username
Zhiying Tan
### Problem Number, Title, and Link
Leetcode 214
### Bug Category
Missing test case *(Incorrect/Inefficient Code getting accepted because of missing test cases)*…
-
Subscribe to this issue and stay notified about new [daily trending repos in Shell](https://github.com/trending/shell?since=daily)!
-
2021-11-12
-
如果序列 `X_1, X_2, ..., X_n` 满足下列条件，就说它是 斐波那契式 的：
- `n >= 3`
- 对于所有 `i + 2
-
### LeetCode Username
ChiragS77
### Problem Number, Title, and Link
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
### Bug Category
Problem description
### Bug Description
…
-
2021-11-29