main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.java
6 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.java
6 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.java
6 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.cpp
6 1 -
A
solution\1000-1099\1006.Clumsy Factorial\Solution.java
6 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
6 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.java
6 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.cpp
6 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.cpp
6 1 -
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.cpp
6 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.java
6 1 -
A
solution\0300-0399\0397.Integer Replacement\Solution.cpp
6 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.py
6 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6 1 -
A
solution\2500-2599\2524.Maximum Frequency Score of a Subarray\Solution.py
6 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.java
6 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.cpp
6 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.java
6 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -