main
leetcode-perl
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0567.Permutation in String\Solution.go
 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.java
6 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.java
3 1 -
A
solution\0800-0899\0831.Masking Personal Information\Solution.go
 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.go
 1 -
A
solution\0500-0599\0567.Permutation in String\Solution.py
11 1 -
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.java
10 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.go
 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.java
2 1 -
A
solution\0400-0499\0490.The Maze\Solution.java
11 1 -
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.py
9 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.cpp
7 1 -
A
solution\0600-0699\0692.Top K Frequent Words\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6 1 -
A
solution\0300-0399\0393.UTF-8 Validation\Solution.java
8 1 -
A
solution\0400-0499\0490.The Maze\Solution.py
8 1 -