main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\images\Solution.java
3 1 -
A
solution\0900-0999\0991.Broken Calculator\Solution.py
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.py
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cs
3 1 -
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.py
3 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.java
3 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.py
3 1 1
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.java
3 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.py
3 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.c
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.cpp
3 1 -