main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.java
10 1 -
A
solution\0600-0699\0662.Maximum Width of Binary Tree\Solution.py
5 1 -
A
solution\0200-0299\0299.Bulls and Cows\Solution.cpp
5 1 -
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.ts
2 1 -
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.py
1 1 -
A
solution\0300-0399\0356.Line Reflection\Solution.java
4 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.py
5 1 -
A
solution\0500-0599\0561.Array Partition\Solution.java
2 1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.java
7 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.go
 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.ts
 1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.py
7 1 -
A
solution\0500-0599\0561.Array Partition\Solution.js
1 1 -
A
solution\0800-0899\0848.Shifting Letters\Solution.cpp
2 1 -
A
solution\0800-0899\0848.Shifting Letters\Solution.java
2 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.cpp
4 1 -
A
solution\0500-0599\0561.Array Partition\Solution.py
1 1 -
A
solution\0800-0899\0848.Shifting Letters\Solution.py
2 1 -