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\0600-0699\0658.Find K Closest Elements\Solution.cpp
4
1
-
A
solution\0600-0699\0658.Find K Closest Elements\Solution.java
4
1
-
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.cpp
4
1
-
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.java
4
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4
1
-
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.cpp
4
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.java
4
1
-
A
solution\0600-0699\0663.Equal Tree Partition\Solution.cpp
4
1
-
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.ts
4
1
-
A
solution\0300-0399\0384.Shuffle an Array\Solution.cpp
4
1
1
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.py
4
1
-
A
solution\2200-2299\2232.Minimize Result by Adding Parentheses to Expression\Solution.ts
4
1
-
A
solution\0800-0899\0899.Orderly Queue\Solution.cpp
4
1
-
A
solution\0600-0699\0665.Non-decreasing Array\Solution.cpp
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.cpp
4
1
-
A
solution\0600-0699\0665.Non-decreasing Array\Solution.py
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.c
4
1
-
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.java
4
1
-
A
solution\2300-2399\2380.Time Needed to Rearrange a Binary String\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!