main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.java
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.cpp
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4 1 -
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.java
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.cpp
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.py
4 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.java
4 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.py
4 1 -
A
solution\0600-0699\0668.Kth Smallest Number in Multiplication Table\Solution.java
4 1 -
A
solution\0600-0699\0668.Kth Smallest Number in Multiplication Table\Solution.py
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.c
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.c
4 1 -
A
solution\2100-2199\2190.Most Frequent Number Following Key In an Array\Solution.java
4 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.cpp
4 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.py
4 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.js
4 1 -