Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
400
issues
2
pull requests
4,688
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0413.Arithmetic Slices\Solution.ts
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.py
3
1
-
A
solution\0800-0899\0810.Chalkboard XOR Game\Solution.cpp
3
1
-
A
solution\2300-2399\2351.First Letter to Appear Twice\Solution.cpp
3
1
-
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.cpp
3
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.ts
3
1
-
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.java
3
1
-
A
solution\0900-0999\0965.Univalued Binary Tree\Solution.cpp
3
1
-
A
solution\0900-0999\0965.Univalued Binary Tree\Solution.ts
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
3
1
-
A
solution\0500-0599\0547.Number of Provinces\Solution.py
3
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.ts
3
1
-
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.js
3
1
-
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.ts
3
1
-
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.java
3
1
-
A
solution\0900-0999\0933.Number of Recent Calls\Solution.py
3
1
-
A
solution\0900-0999\0933.Number of Recent Calls\Solution.java
3
1
1
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.c
3
1
-
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cpp
3
1
-
A
solution\2100-2199\2138.Divide a String Into Groups of Size k\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!