main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.cpp
4 1 -
A
solution\0800-0899\0896.Monotonic Array\Solution.ts
5 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.java
4 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.go
 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.cpp
8 1 -
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.java
4 1 -
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.cpp
5 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.go
 1 -
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.java
7 1 -
A
solution\0600-0699\0630.Course Schedule III\Solution.cpp
3 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.cpp
5 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.go
 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.go
 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.java
4 1 -
A
solution\0300-0399\0399.Evaluate Division\Solution.py
8 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.java
8 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.java
10 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.cpp
6 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.go
 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.py
7 1 -