Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-beef
332
issues
2
pull requests
4,136
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.cpp
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\0400-0499\0445.Add Two Numbers II\Solution.ts
5
1
-
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.java
5
1
1
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.cpp
5
1
-
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5
1
-
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.cpp
5
1
-
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.cpp
5
1
-
A
solution\2100-2199\2108.Find First Palindromic String in the Array\Solution.c
5
1
-
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.java
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.py
5
1
-
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.java
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.java
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!