Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-idris
393
issues
2
pull requests
4,706
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.js
3
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3
1
-
A
solution\2100-2199\2138.Divide a String Into Groups of Size k\Solution.java
3
1
-
A
solution\0300-0399\0322.Coin Change\Solution.ts
3
1
-
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\images\Solution.java
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
3
1
-
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3
1
-
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3
1
-
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.ts
3
1
-
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.java
3
1
-
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.py
3
1
-
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\Solution.cpp
3
1
-
A
solution\0900-0999\0947.Most Stones Removed with Same Row or Column\Solution.py
3
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3
1
-
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.py
3
1
-
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.py
3
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.ts
3
1
-
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3
1
-
A
solution\2100-2199\2149.Rearrange Array Elements by Sign\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!