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\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2
1
-
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.py
2
1
-
A
solution\2500-2599\2530.Maximal Score After Applying K Operations\Solution.cpp
2
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2
1
-
A
solution\0300-0399\0346.Moving Average from Data Stream\Solution.cpp
2
1
-
A
solution\2500-2599\2550.Count Collisions of Monkeys on a Polygon\Solution.ts
2
1
-
A
solution\0300-0399\0346.Moving Average from Data Stream\Solution.java
2
1
1
A
solution\2500-2599\2522.Partition String Into Substrings With Values at Most K\Solution.py
2
1
-
A
solution\0500-0599\0535.Encode and Decode TinyURL\Solution.cpp
2
1
-
A
solution\0500-0599\0535.Encode and Decode TinyURL\Solution.java
2
1
1
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cs
2
1
1
A
solution\2000-2099\2052.Minimum Cost to Separate Sentence Into Rows\Solution.py
2
1
-
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.js
2
1
-
A
solution\0700-0799\0733.Flood Fill\Solution.ts
2
1
-
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.py
2
1
-
A
solution\2500-2599\2510.Check if There is a Path With Equal Number of 0's And 1's\Solution.py
2
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.py
2
1
-
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.java
2
1
-
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.py
2
1
-
A
solution\2400-2499\2491.Divide Players Into Teams of Equal Skill\Solution.ts
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!