Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode
1,317
issues
0
pull requests
4,781
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\1400-1499\1426.Counting Elements\Solution.java
4
1
-
A
solution\1400-1499\1426.Counting Elements\Solution.go
1
-
A
solution\1400-1499\1426.Counting Elements\Solution.cpp
4
1
-
A
solution\1400-1499\1423.Maximum Points You Can Obtain from Cards\Solution.py
4
1
-
A
solution\1400-1499\1423.Maximum Points You Can Obtain from Cards\Solution.java
4
1
-
A
solution\1400-1499\1423.Maximum Points You Can Obtain from Cards\Solution.go
1
-
A
solution\1400-1499\1423.Maximum Points You Can Obtain from Cards\Solution.cpp
4
1
-
A
solution\1400-1499\1419.Minimum Number of Frogs Croaking\Solution.py
15
1
-
A
solution\1400-1499\1419.Minimum Number of Frogs Croaking\Solution.java
15
1
-
A
solution\1400-1499\1419.Minimum Number of Frogs Croaking\Solution.go
1
-
A
solution\1400-1499\1419.Minimum Number of Frogs Croaking\Solution.cpp
14
1
-
A
solution\1400-1499\1418.Display Table of Food Orders in a Restaurant\Solution.py
4
1
-
A
solution\1400-1499\1418.Display Table of Food Orders in a Restaurant\Solution.java
4
1
-
A
solution\1400-1499\1418.Display Table of Food Orders in a Restaurant\Solution.go
1
-
A
solution\1400-1499\1418.Display Table of Food Orders in a Restaurant\Solution.cpp
5
1
-
A
solution\1400-1499\1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K\Solution.ts
4
1
1
A
solution\1400-1499\1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K\Solution.py
1
1
-
A
solution\1400-1499\1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K\Solution.java
3
1
-
A
solution\1400-1499\1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K\Solution.go
1
-
A
solution\1400-1499\1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K\Solution.cpp
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!