main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.c
4 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.py
7 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.java
6 1 -
A
solution\2500-2599\2528.Maximize the Minimum Powered City\Solution.py
4 1 -
A
solution\0600-0699\0656.Coin Path\Solution.cpp
8 1 -
A
solution\2500-2599\2529.Maximum Count of Positive Integer and Negative Integer\Solution.java
4 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\2500-2599\2530.Maximal Score After Applying K Operations\Solution.cpp
2 1 -
A
solution\0400-0499\0473.Matchsticks to Square\Solution.go
 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.go
 1 -
A
solution\0300-0399\0352.Data Stream as Disjoint Intervals\Solution.cpp
14 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.ts
9 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.py
6 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.c
4 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.cpp
3 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.cpp
5 1 -
A
solution\2000-2099\2028.Find Missing Observations\Solution.go
 1 -