Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-tsh
326
issues
2
pull requests
4,526
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.cpp
8
1
-
A
solution\0500-0599\0555.Split Concatenated Strings\Solution.cpp
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.py
8
1
-
A
solution\0800-0899\0886.Possible Bipartition\Solution.ts
8
1
-
A
solution\0800-0899\0886.Possible Bipartition\Solution.java
8
1
-
A
solution\0800-0899\0885.Spiral Matrix III\Solution.py
8
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
8
1
-
A
solution\2100-2199\2100.Find Good Days to Rob the Bank\Solution.py
8
1
-
A
solution\0700-0799\0767.Reorganize String\Solution.cpp
8
1
-
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.cpp
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.cpp
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.java
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.c
8
1
-
A
solution\0500-0599\0562.Longest Line of Consecutive One in Matrix\Solution.py
8
1
-
A
solution\2300-2399\2332.The Latest Time to Catch a Bus\Solution.java
8
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.cpp
8
1
-
A
solution\2300-2399\2332.The Latest Time to Catch a Bus\Solution.py
8
1
-
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.cpp
8
1
-
A
solution\0600-0699\0656.Coin Path\Solution.cpp
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!