main
leetcode-coffeescript
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.java
4 1 -
A
solution\0500-0599\0582.Kill Process\Solution.cpp
4 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.cpp
4 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.java
4 1 -
A
solution\0900-0999\0977.Squares of a Sorted Array\Solution.cpp
4 1 -
A
solution\0500-0599\0582.Kill Process\Solution.java
4 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.c
4 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.java
4 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.cpp
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
4 1 -
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.ts
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.cpp
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.py
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -