main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0901.Online Stock Span\Solution.py
4 1 -
A
solution\2400-2499\2476.Closest Nodes Queries in a Binary Search Tree\Solution.go
 1 -
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.go
 1 -
A
solution\2400-2499\2476.Closest Nodes Queries in a Binary Search Tree\Solution.py
4 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.cpp
15 1 -
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.go
 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.py
3 1 -
A
solution\2500-2599\2539.Count the Number of Good Subsequences\Solution.java
11 1 -
A
solution\2500-2599\2539.Count the Number of Good Subsequences\Solution.go
 1 -
A
solution\2500-2599\2509.Cycle Length Queries in a Tree\Solution.py
4 1 -
A
solution\2400-2499\2499.Minimum Total Cost to Make Arrays Unequal\Solution.cpp
11 1 -
A
solution\2400-2499\2495.Number of Subarrays Having Even Product\Solution.go
 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.py
2 1 -
A
solution\2400-2499\2485.Find the Pivot Integer\Solution.go
 1 -
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.go
 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.go
 1 -
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.cpp
6 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0800-0899\0876.Middle of the Linked List\Solution.go
 1 -
A
solution\2400-2499\2431.Maximize Total Tastiness of Purchased Fruits\Solution.java
7 1 -