-
Use recursion visualizer: https://recursion.vercel.app/
https://leetcode.com/problems/n-th-tribonacci-number/
```js
var tribonacci = function(n) {
if (n == 0) {
return 0
}
…
-
Type: Performance Issue
Visual Studio Code crashes my laptop, its freezing the whole laptop.
I am unable to code better due to again and again open and closing and hanging laptop due to vs code
VS…
-
I was not able to download problems after login. I'm running the plugin behind corporate firewall, I am sure the proxy setting is working fine. The LeetCode log as below:
VS Code: **1.47.2**
```
…
-
### LeetCode Username
soyukotoda
### Problem Number, Title, and Link
1257. Smallest Common Region https://leetcode.com/problems/smallest-common-region/
### Bug Category
Missing test case *(Incorr…
-
```bash
Buildfile: /leetcode-helper/build.xml
compile:
[echo] Compile source code for problem two_sum ...
[javac] Compiling 1 source file to /leetcode-helper/build
[javac] Compilin…
-
### Pandas version checks
- [X] I have checked that this issue has not already been reported.
- [X] I have confirmed this bug exists on the [latest version](https://pandas.pydata.org/docs/whatsnew/i…
-
# 01
## algorithm
```python
# https://leetcode-cn.com/problems/combinations/
# 77. 组合
# clarify 不能有重复组合，穷尽所有可能组合
# possible solution 回溯？！
#
from collections import deque
class Solution…
-
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols `+` and `-`. For each integer, you should choose one from `+` and `-` as its new symbol.
Fin…
-
给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。
示例:
```
输入: n = 4, k = 2
输出:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
```
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/…
-
给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。
你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。
示例:
```
给定 1->2->3->4, 你应该返回 2->1->4->3.
```
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/swap-nodes-in-pairs
著作权归领…