main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\2300-2399\2365.Task Scheduler II\Solution.java
2 1 -
A
solution\2300-2399\2365.Task Scheduler II\Solution.cpp
2 1 -
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.java
2 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.cpp
2 1 -
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.cpp
2 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2 1 -
A
solution\0800-0899\0867.Transpose Matrix\Solution.js
2 1 -
A
solution\2300-2399\2351.First Letter to Appear Twice\Solution.ts
2 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cs
2 1 1
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2 1 1
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.cpp
2 1 -
A
solution\2300-2399\2330.Valid Palindrome IV\Solution.cpp
2 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.ts
2 1 -
A
solution\2300-2399\2330.Valid Palindrome IV\Solution.ts
2 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.ts
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2 1 -
A
solution\2300-2399\2323.Find Minimum Time to Finish All Jobs II\Solution.java
2 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.java
2 1 -