Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-chez
393
issues
2
pull requests
3,872
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.java
4
1
-
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.java
4
1
-
A
solution\2400-2499\2489.Number of Substrings With Fixed Ratio\Solution.java
4
1
-
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4
1
-
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.c
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.cpp
4
1
-
A
solution\0300-0399\0387.First Unique Character in a String\Solution.java
4
1
-
A
solution\0900-0999\0944.Delete Columns to Make Sorted\Solution.java
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.java
4
1
-
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.java
4
1
-
A
solution\0900-0999\0948.Bag of Tokens\Solution.java
4
1
-
A
solution\0900-0999\0948.Bag of Tokens\Solution.py
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.c
4
1
-
A
solution\0600-0699\0668.Kth Smallest Number in Multiplication Table\Solution.java
4
1
-
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.java
4
1
-
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.java
4
1
-
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.ts
4
1
-
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.py
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!