main
leetcode-coffeescript
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2109.Adding Spaces to a String\Solution.cpp
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.ts
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\0600-0699\0621.Task Scheduler\Solution.java
4 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.cpp
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4 1 -
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.java
4 1 -
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.ts
4 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.java
4 1 -
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.cpp
4 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.cs
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.ts
4 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.cpp
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.cpp
4 1 -
A
solution\2300-2399\2327.Number of People Aware of a Secret\Solution.py
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.py
4 1 -