main
leetcode-perl
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0645.Set Mismatch\Solution.py
7 1 -
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.cpp
7 1 -
A
solution\2100-2199\2135.Count Words Obtained After Adding a Letter\Solution.java
7 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7 1 -
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.java
7 1 -
A
solution\0900-0999\0917.Reverse Only Letters\Solution.cpp
7 1 -
A
solution\0900-0999\0917.Reverse Only Letters\Solution.java
7 1 -
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.py
7 1 -
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.java
7 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.java
7 1 -
A
solution\2400-2499\2434.Using a Robot to Print the Lexicographically Smallest String\Solution.cpp
7 1 -
A
solution\2400-2499\2402.Meeting Rooms III\Solution.py
7 1 -
A
solution\2100-2199\2135.Count Words Obtained After Adding a Letter\Solution.py
7 1 -
A
solution\0600-0699\0656.Coin Path\Solution.ts
7 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.java
7 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.cpp
7 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.cpp
7 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.ts
7 1 -