Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
402
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0978.Longest Turbulent Subarray\Solution.ts
3
1
-
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.cpp
3
1
-
A
solution\0400-0499\0424.Longest Repeating Character Replacement\Solution.cpp
3
1
-
A
solution\0500-0599\0565.Array Nesting\Solution.cpp
3
1
-
A
solution\0500-0599\0565.Array Nesting\Solution.java
3
1
-
A
solution\0400-0499\0424.Longest Repeating Character Replacement\Solution.java
3
1
-
A
solution\0500-0599\0566.Reshape the Matrix\Solution.cpp
3
1
-
A
solution\0900-0999\0977.Squares of a Sorted Array\Solution.py
3
1
-
A
solution\0800-0899\0851.Loud and Rich\Solution.py
3
1
-
A
solution\0500-0599\0566.Reshape the Matrix\Solution.java
3
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.py
3
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.java
3
1
-
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.ts
3
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.js
3
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3
1
-
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3
1
-
A
solution\0500-0599\0566.Reshape the Matrix\Solution.ts
3
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.py
3
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.ts
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!