Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-beef
323
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2185.Counting Words With a Given Prefix\Solution.ts
1
1
-
A
solution\0800-0899\0878.Nth Magical Number\Solution.py
1
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2
1
-
A
solution\0700-0799\0796.Rotate String\Solution.py
2
1
-
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2
1
-
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2
1
-
A
solution\0700-0799\0796.Rotate String\Solution.java
2
1
-
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.py
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.cpp
2
1
-
A
solution\0500-0599\0598.Range Addition II\Solution.cpp
2
1
-
A
solution\0500-0599\0598.Range Addition II\Solution.py
2
1
-
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.py
2
1
-
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2
1
-
A
solution\2400-2499\2427.Number of Common Factors\Solution.cpp
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.java
2
1
-
A
solution\0800-0899\0841.Keys and Rooms\Solution.ts
2
1
-
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2
1
1
A
solution\0700-0799\0769.Max Chunks To Make Sorted\Solution.ts
2
1
-
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.ts
2
1
-
A
solution\0400-0499\0453.Minimum Moves to Equal Array Elements\Solution.cpp
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!