main
leetcode-coffeescript
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2418.Sort the People\Solution.ts
2 1 -
A
solution\2400-2499\2418.Sort the People\Solution.cpp
2 1 -
A
solution\2400-2499\2414.Length of the Longest Alphabetical Continuous Substring\Solution.ts
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
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.cpp
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2 1 -
A
solution\0600-0699\0623.Add One Row to Tree\Solution.py
2 1 -
A
solution\0600-0699\0624.Maximum Distance in Arrays\Solution.cpp
2 1 -
A
solution\0600-0699\0624.Maximum Distance in Arrays\Solution.java
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2 1 -
A
solution\0900-0999\0910.Smallest Range II\Solution.cpp
2 1 -
A
solution\0900-0999\0910.Smallest Range II\Solution.java
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\0400-0499\0464.Can I Win\Solution.py
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -