main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0455.Assign Cookies\Solution.ts
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.java
4 1 -
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.java
4 1 -
A
solution\0900-0999\0922.Sort Array By Parity II\Solution.java
4 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4 1 -
A
solution\0900-0999\0915.Partition Array into Disjoint Intervals\Solution.cpp
4 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.cpp
4 1 1
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.c
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.java
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.cpp
4 1 -
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.java
4 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.cpp
4 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.java
4 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.cpp
4 1 -
A
solution\0300-0399\0339.Nested List Weight Sum\Solution.java
4 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.ts
4 1 1
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.cpp
4 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.java
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -