main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.c
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\0300-0399\0343.Integer Break\Solution.cpp
4 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.js
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\0400-0499\0483.Smallest Good Base\Solution.cpp
4 1 -
A
solution\0300-0399\0345.Reverse Vowels of a String\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.ts
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\0400-0499\0484.Find Permutation\Solution.cpp
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.cpp
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.cpp
4 1 -