main
leetcode-chef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2539.Count the Number of Good Subsequences\Solutoin.cpp
0 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.c
6 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.cpp
0 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.go
 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.java
5 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.ts
5 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.c
7 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.cpp
0 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.go
 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.java
6 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.py
6 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.ts
5 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.cpp
0 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.go
 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.java
4 1 -
A
solution\2500-2599\2546.Apply Bitwise Operations to Make Strings Equal\Solution.c
5 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.cpp
0 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.go
 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.java
7 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.py
1 1 -