main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0382.Linked List Random Node\Solution.java
4 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.java
4 1 -
A
solution\2200-2299\2268.Minimum Number of Keypresses\Solution.java
4 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.java
4 1 -
A
solution\2000-2099\2009.Minimum Number of Operations to Make Array Continuous\Solution.cpp
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.cpp
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\0600-0699\0694.Number of Distinct Islands\Solution.py
4 1 -
A
solution\0600-0699\0695.Max Area of Island\Solution.py
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.cpp
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.ts
4 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.cpp
4 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.java
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.cpp
5 1 -