main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.go
 1 -
A
solution\2500-2599\2510.Check if There is a Path With Equal Number of 0's And 1's\Solution.py
2 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.js
5 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.go
 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.java
5 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.py
7 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.cpp
0 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.cpp
8 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 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 -
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 -