-
Given a string `s` and an array of strings `words`, return _the number of_ `words[i]` _that is a subsequence of_ `s`.
A subsequence of a string is a new string generated from the original stri…
-
### LeetCode 用户名
wshao
### 问题号码、标题和链接
2639. 查询网格图中每一列的宽度 https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/description/?envType=daily-question&envId=2024-04-27
### Bug Category
缺少测…
-
### LeetCode Username
Sushi_31
### Problem Number, Title, and Link
https://leetcode.com/problems/rotate-array/description/
### Bug Category
Problem examples
### Bug Description
Input: nums = [5…
-
# 232. 用栈实现队列
## 入选理由
暂无
## 题目地址
[https://leetcode-cn.com/problems/implement-queue-using-stacks/](https://leetcode-cn.com/problems/implement-queue-using-stacks/)
## 前置知识
…
-
this will take a bit longer time. first, we have to add links to all companies.
-
### LeetCode Username
SerialVelocity
### Problem Number, Title, and Link
https://leetcode.com/problems/search-in-rotated-sorted-array/
### Bug Category
Missing test case *(Incorrect/Ine…
-
[Repl](https://repl.it/@thefireskater/TopSort)
When there is a partial ordering, topological sort is likely the way to go.
Create a list of the vertices such that vertices do not appear before t…
-
### Is there an existing issue for this?
- [X] I have searched the existing issues
### Feature Description
Describe the new feature or enhancement you'd like to see:
I would like to contribute a s…
-
# 62. 不同路径
## 入选理由
暂无
## 题目地址
[https://leetcode-cn.com/problems/unique-paths/](https://leetcode-cn.com/problems/unique-paths/)
## 前置知识
暂无
## 题目描述
```
一个机器人位于一个 m x n 网…
-
Root cause:
```ts
export function useObservableInternal(...): Observable {
if (!inputs) {
return useState(init as () => Observable)[0]
}
const [inputs$] = useState(() => new Behavior…