Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-scheme
407
issues
2
pull requests
4,052
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.java
8
1
-
A
solution\2000-2099\2052.Minimum Cost to Separate Sentence Into Rows\Solution.cpp
8
1
-
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.ts
8
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.ts
8
1
5
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.cpp
8
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.java
8
1
-
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.cpp
8
1
-
A
solution\0400-0499\0490.The Maze\Solution.py
8
1
-
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8
1
11
A
solution\0800-0899\0820.Short Encoding of Words\Solution.java
8
1
2
A
solution\0300-0399\0348.Design Tic-Tac-Toe\Solution.java
8
1
1
A
solution\0300-0399\0393.UTF-8 Validation\Solution.java
8
1
-
A
solution\0300-0399\0393.UTF-8 Validation\Solution.py
8
1
-
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.cpp
8
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.cpp
8
1
-
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.java
8
1
-
A
solution\2000-2099\2093.Minimum Cost to Reach City With Discounts\Solution.py
8
1
-
A
solution\0400-0499\0498.Diagonal Traverse\Solution.cpp
8
1
-
A
solution\2000-2099\2098.Subsequence of Size K With the Largest Even Sum\Solution.java
8
1
-
A
solution\2100-2199\2100.Find Good Days to Rob the Bank\Solution.cpp
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!