Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-tsh
317
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.java
3
1
-
A
solution\0400-0499\0473.Matchsticks to Square\Solution.py
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.py
3
1
-
A
solution\0300-0399\0396.Rotate Function\Solution.cpp
3
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3
1
-
A
solution\0300-0399\0396.Rotate Function\Solution.java
3
1
-
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
3
1
-
A
solution\0400-0499\0475.Heaters\Solution.py
3
1
-
A
solution\0400-0499\0475.Heaters\Solution.ts
3
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.py
3
1
-
A
solution\0700-0799\0799.Champagne Tower\Solution.ts
3
1
-
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.cpp
3
1
-
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.java
3
1
-
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\Solution.cpp
3
1
-
A
solution\0400-0499\0477.Total Hamming Distance\Solution.cpp
3
1
-
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.cpp
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!