Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-c3
376
issues
2
pull requests
4,272
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0394.Decode String\Solution.py
5
1
-
A
solution\0300-0399\0394.Decode String\Solution.ts
5
1
-
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5
1
-
A
solution\0500-0599\0525.Contiguous Array\Solution.cpp
5
1
-
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.py
5
1
-
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.java
5
1
-
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5
1
-
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5
1
-
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.java
5
1
-
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.py
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\0300-0399\0397.Integer Replacement\Solution.java
5
1
-
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.py
5
1
-
A
solution\0300-0399\0398.Random Pick Index\Solution.cpp
5
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!