Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-nushell
381
issues
2
pull requests
4,280
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3
1
-
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.cpp
3
1
-
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.java
3
1
-
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.py
3
1
-
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3
1
-
A
solution\0700-0799\0744.Find Smallest Letter Greater Than Target\Solution.java
3
1
-
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.java
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.c
3
1
-
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.py
3
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3
1
-
A
solution\0700-0799\0744.Find Smallest Letter Greater Than Target\Solution.ts
3
1
-
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.ts
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.cpp
3
1
-
A
solution\0500-0599\0518.Coin Change II\Solution.cpp
3
1
-
A
solution\0500-0599\0519.Random Flip Matrix\Solution.java
3
1
-
A
solution\0500-0599\0519.Random Flip Matrix\Solution.py
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3
1
-
A
solution\2200-2299\2217.Find Palindrome With Fixed Length\Solution.cpp
3
1
-
A
solution\2200-2299\2217.Find Palindrome With Fixed Length\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!