main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2116.Check if a Parentheses String Can Be Valid\Solution.go
 1 -
A
solution\2100-2199\2116.Check if a Parentheses String Can Be Valid\Solution.cpp
12 1 -
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.py
7 1 -
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.java
8 1 -
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.go
 1 -
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.cpp
8 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.ts
1 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.py
2 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.java
4 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.cpp
2 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.c
4 1 -
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.py
6 1 -
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.java
6 1 -
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.go
 1 -
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.cpp
6 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.py
2 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.java
9 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.go
 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.cpp
7 1 -
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.ts
3 1 -