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\2300-2399\2363.Merge Similar Items\Solution.java
5
1
-
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5
1
-
A
solution\2100-2199\2130.Maximum Twin Sum of a Linked List\Solution.py
5
1
-
A
solution\0300-0399\0313.Super Ugly Number\Solution.py
5
1
-
A
solution\0500-0599\0525.Contiguous Array\Solution.cpp
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.java
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5
1
2
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.cpp
5
1
-
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.java
5
1
-
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.py
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.cpp
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.c
5
1
-
A
solution\0400-0499\0404.Sum of Left Leaves\Solution.java
5
1
-
A
solution\0700-0799\0776.Split BST\Solution.cpp
5
1
-
A
solution\0400-0499\0404.Sum of Left Leaves\Solution.py
5
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5
1
-
A
solution\0900-0999\0907.Sum of Subarray Minimums\Solution.ts
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.java
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.py
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!