main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.cpp
4 1 -
A
solution\0900-0999\0922.Sort Array By Parity II\Solution.java
4 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.java
5 1 -
A
solution\0600-0699\0645.Set Mismatch\Solution.py
7 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.py
2 1 -
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.go
 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\0300-0399\0341.Flatten Nested List Iterator\Solution.cpp
7 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 -
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\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 -