main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.cpp
5 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.java
5 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.py
5 1 -
A
solution\2100-2199\2155.All Divisions With the Highest Score of a Binary Array\Solution.py
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5 1 -
A
solution\0900-0999\0907.Sum of Subarray Minimums\Solution.ts
5 1 -
A
solution\0800-0899\0811.Subdomain Visit Count\Solution.py
5 1 -
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.java
5 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.py
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.cpp
5 1 -
A
solution\0300-0399\0369.Plus One Linked List\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.java
5 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.ts
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.py
5 1 -