Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-elixir
413
issues
2
pull requests
3,677
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0200-0299\0297.Serialize and Deserialize Binary Tree\Solution.cpp
9
1
-
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.cpp
9
1
-
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.java
9
1
-
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.py
9
1
-
A
solution\0700-0799\0720.Longest Word in Dictionary\Solution.cpp
9
1
-
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.java
9
1
-
A
solution\0700-0799\0720.Longest Word in Dictionary\Solution.java
9
1
-
A
solution\0300-0399\0310.Minimum Height Trees\Solution.java
9
1
-
A
solution\0300-0399\0310.Minimum Height Trees\Solution.py
9
1
-
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.java
9
1
-
A
solution\0700-0799\0733.Flood Fill\Solution.java
9
1
-
A
solution\2100-2199\2146.K Highest Ranked Items Within a Price Range\Solution.py
9
1
-
A
solution\0500-0599\0505.The Maze II\Solution.py
9
1
-
A
solution\2100-2199\2147.Number of Ways to Divide a Long Corridor\Solution.java
9
1
-
A
solution\2100-2199\2157.Groups of Strings\Solution.py
9
1
-
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.cpp
9
1
-
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.java
9
1
-
A
solution\2100-2199\2179.Count Good Triplets in an Array\Solution.cpp
9
1
1
A
solution\2100-2199\2179.Count Good Triplets in an Array\Solution.java
9
1
1
A
solution\2100-2199\2179.Count Good Triplets in an Array\Solution.py
9
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!