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\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.cpp
7 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\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.java
8 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.go
 1 -
A
solution\2400-2499\2479.Maximum XOR of Two Non-Overlapping Subtrees\Solution.py
10 1 -
A
solution\2400-2499\2470.Number of Subarrays With LCM Equal to K\Solution.cpp
3 1 -
A
solution\2400-2499\2466.Count Ways To Build Good Strings\Solution.cpp
3 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.cpp
6 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.java
8 1 -
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.cpp
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.go
 1 -
A
solution\0300-0399\0323.Number of Connected Components in an Undirected Graph\Solution.go
 1 -
A
solution\0700-0799\0704.Binary Search\Solution.go
 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.go
 1 -