Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-tsh
326
issues
2
pull requests
4,526
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2303.Calculate Amount Paid in Taxes\Solution.go
1
-
A
solution\0700-0799\0798.Smallest Rotation with Highest Score\Solution.cpp
4
1
-
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.cpp
4
1
-
A
solution\0500-0599\0556.Next Greater Element III\Solution.cpp
6
1
-
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.java
5
1
-
A
solution\0700-0799\0798.Smallest Rotation with Highest Score\Solution.java
4
1
-
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.ts
5
1
-
A
solution\0400-0499\0436.Find Right Interval\Solution.ts
5
1
-
A
solution\2300-2399\2305.Fair Distribution of Cookies\Solution.go
1
-
A
solution\0700-0799\0799.Champagne Tower\Solution.cpp
4
1
-
A
solution\2300-2399\2305.Fair Distribution of Cookies\Solution.py
1
1
-
A
solution\0600-0699\0633.Sum of Square Numbers\Solution.ts
4
1
-
A
solution\0900-0999\0901.Online Stock Span\Solution.ts
1
1
-
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.cpp
15
1
-
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.go
1
-
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2
1
-
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.go
1
-
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.java
2
1
-
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.java
18
1
-
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.cpp
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!