main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0369.Plus One Linked List\Solution.java
5 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.java
7 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5 1 -
A
solution\0500-0599\0573.Squirrel Simulation\Solution.java
4 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.go
 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.cpp
7 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.py
3 1 -
A
solution\0400-0499\0436.Find Right Interval\Solution.cpp
7 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.cpp
5 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.go
 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.go
 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.py
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.java
6 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.py
7 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.go
 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.ts
4 1 -