main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0464.Can I Win\Solution.py
2 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.py
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.java
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.py
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\0900-0999\0926.Flip String to Monotone Increasing\Solution.js
2 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\2300-2399\2365.Task Scheduler II\Solution.ts
2 1 -
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.java
2 1 -
A
solution\2300-2399\2363.Merge Similar Items\Solution.ts
2 1 -
A
solution\2300-2399\2365.Task Scheduler II\Solution.java
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.py
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.ts
2 1 -
A
solution\2300-2399\2351.First Letter to Appear Twice\Solution.ts
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.py
2 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.py
2 1 -
A
solution\2300-2399\2335.Minimum Amount of Time to Fill Cups\Solution.ts
2 1 -