Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-lisp
383
issues
2
pull requests
4,717
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.py
3
1
-
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.cpp
5
1
-
A
solution\2200-2299\2281.Sum of Total Strength of Wizards\Solution.cpp
12
1
-
A
solution\0500-0599\0556.Next Greater Element III\Solution.go
1
-
A
solution\2200-2299\2281.Sum of Total Strength of Wizards\Solution.java
12
1
-
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.java
5
1
-
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5
1
-
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.py
2
1
-
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9
1
-
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.java
10
1
-
A
solution\2300-2399\2310.Sum of Numbers With Units Digit K\Solution.java
5
1
-
A
solution\2300-2399\2302.Count Subarrays With Score Less Than K\Solution.go
1
-
A
solution\2300-2399\2300.Successful Pairs of Spells and Potions\Solution.go
1
-
A
solution\2200-2299\2296.Design a Text Editor\Solution.py
8
1
-
A
solution\2200-2299\2295.Replace Elements in an Array\Solution.go
1
-
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.cpp
12
1
-
A
solution\0300-0399\0305.Number of Islands II\Solution.go
1
-
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.java
8
1
-
A
solution\0400-0499\0454.4Sum II\Solution.ts
6
1
-
A
solution\0900-0999\0913.Cat and Mouse\Solution.java
20
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!