main
leetcode-perl
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.py
4 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.cpp
7 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.cpp
3 1 -
A
solution\0400-0499\0415.Add Strings\Solution.java
16 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.java
3 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\0500-0599\0541.Reverse String II\Solution.py
2 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.java
3 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.go
 1 -
A
solution\2300-2399\2310.Sum of Numbers With Units Digit K\Solution.go
 1 -
A
solution\2300-2399\2301.Match Substring After Replacement\Solution.go
 1 -
A
solution\2200-2299\2296.Design a Text Editor\Solution.go
 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.py
3 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.py
2 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.py
2 1 -
A
solution\0300-0399\0367.Valid Perfect Square\Solution.py
3 1 -
A
solution\0400-0499\0436.Find Right Interval\Solution.cpp
7 1 -
A
solution\0500-0599\0582.Kill Process\Solution.go
 1 -
A
solution\0800-0899\0867.Transpose Matrix\Solution.py
1 1 -