Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
411
issues
2
pull requests
4,376
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.java
7
1
-
A
solution\0800-0899\0817.Linked List Components\Solution.cpp
6
1
-
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.cpp
2
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8
1
-
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.go
1
-
A
solution\0800-0899\0817.Linked List Components\Solution.java
8
1
-
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.ts
1
1
-
A
solution\0500-0599\0548.Split Array with Equal Sum\Solution.go
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.go
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.go
1
-
A
solution\2300-2399\2348.Number of Zero-Filled Subarrays\Solution.go
1
-
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.cpp
3
1
-
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.java
10
1
-
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6
1
-
A
solution\0300-0399\0307.Range Sum Query - Mutable\Solution.cpp
10
1
-
A
solution\0300-0399\0325.Maximum Size Subarray Sum Equals k\Solution.java
4
1
-
A
solution\0300-0399\0372.Super Pow\Solution.java
5
1
-
A
solution\0600-0699\0641.Design Circular Deque\Solution.py
16
1
-
A
solution\0900-0999\0948.Bag of Tokens\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!