Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-c3
376
issues
2
pull requests
4,272
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\0400-0499\0412.Fizz Buzz\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0200-0299\0281.Zigzag Iterator\Solution.java
5
1
1
A
solution\0400-0499\0412.Fizz Buzz\Solution.py
5
1
-
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5
1
-
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.cpp
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5
1
-
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.cpp
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
A
solution\2400-2499\2425.Bitwise XOR of All Pairings\Solution.cpp
5
1
-
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5
1
-
A
solution\0200-0299\0290.Word Pattern\Solution.java
5
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5
1
-
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.cpp
5
1
-
A
solution\2400-2499\2496.Maximum Value of a String in an Array\Solution.c
5
1
-
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!