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\2100-2199\2190.Most Frequent Number Following Key In an Array\Solution.java
4
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.java
4
1
-
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.java
4
1
-
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.java
4
1
-
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
4
1
-
A
solution\2300-2399\2353.Design a Food Rating System\Solution.cpp
4
1
-
A
solution\2300-2399\2353.Design a Food Rating System\Solution.py
4
1
-
A
solution\0300-0399\0384.Shuffle an Array\Solution.cpp
4
1
1
A
solution\0400-0499\0483.Smallest Good Base\Solution.cpp
4
1
-
A
solution\2100-2199\2190.Most Frequent Number Following Key In an Array\Solution.py
4
1
-
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.c
4
1
-
A
solution\0400-0499\0484.Find Permutation\Solution.cpp
4
1
-
A
solution\0900-0999\0948.Bag of Tokens\Solution.java
4
1
-
A
solution\0900-0999\0922.Sort Array By Parity II\Solution.cpp
4
1
-
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.cpp
4
1
-
A
solution\0900-0999\0993.Cousins in Binary Tree\Solution.cpp
4
1
-
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.java
4
1
-
A
solution\0600-0699\0690.Employee Importance\Solution.java
4
1
-
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.cpp
4
1
-
A
solution\0600-0699\0692.Top K Frequent Words\Solution.cpp
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!