main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.cpp
7 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.py
3 1 -
A
solution\2300-2399\2376.Count Special Integers\Solution.py
9 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.go
 1 -
A
solution\0300-0399\0368.Largest Divisible Subset\Solution.cpp
8 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\0800-0899\0844.Backspace String Compare\Solution.java
14 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\0500-0599\0565.Array Nesting\Solution.go
 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 -