main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.cpp
6 1 -
A
solution\0600-0699\0656.Coin Path\Solution.cpp
8 1 -
A
solution\0600-0699\0656.Coin Path\Solution.go
 1 -
A
solution\0600-0699\0656.Coin Path\Solution.java
9 1 -
A
solution\0400-0499\0472.Concatenated Words\Solution.py
7 1 -
A
solution\0600-0699\0656.Coin Path\Solution.py
9 1 -
A
solution\0600-0699\0656.Coin Path\Solution.ts
7 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.py
9 1 -
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.java
4 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.go
 1 -
A
solution\0400-0499\0473.Matchsticks to Square\Solution.cpp
11 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.java
7 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.ts
2 1 -
A
solution\0400-0499\0473.Matchsticks to Square\Solution.go
 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.java
4 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.cpp
7 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.java
5 1 -
A
solution\0400-0499\0473.Matchsticks to Square\Solution.java
11 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.go
 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -