main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4 1 -
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.java
4 1 -
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.cs
4 1 -
A
solution\0500-0599\0593.Valid Square\Solution.py
4 1 -
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.java
4 1 -
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.ts
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4 1 -
A
solution\0500-0599\0594.Longest Harmonious Subsequence\Solution.cpp
4 1 -
A
solution\2500-2599\2509.Cycle Length Queries in a Tree\Solution.java
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.java
4 1 -
A
solution\0800-0899\0877.Stone Game\Solution.java
4 1 -
A
solution\0500-0599\0594.Longest Harmonious Subsequence\Solution.java
4 1 -
A
solution\0800-0899\0878.Nth Magical Number\Solution.cpp
4 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.java
4 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.java
4 1 -