main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.ts
2 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2 1 -
A
solution\0900-0999\0910.Smallest Range II\Solution.java
2 1 -
A
solution\2600-2699\2607.Make K-Subarray Sums Equal\Solution.ts
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.py
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
2 1 -
A
solution\2600-2699\2606.Find the Substring With Maximum Cost\Solution.ts
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.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.ts
2 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.py
2 1 1
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cs
2 1 1
A
solution\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.py
2 1 -