main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.ts
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.ts
3 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.js
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.java
3 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.ts
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.java
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.py
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.py
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.cpp
3 1 -
A
solution\2200-2299\2201.Count Artifacts That Can Be Extracted\Solution.py
3 1 -
A
solution\0300-0399\0322.Coin Change\Solution.js
3 1 -
A
solution\0500-0599\0506.Relative Ranks\Solution.py
3 1 -
A
solution\2100-2199\2194.Cells in a Range on an Excel Sheet\Solution.py
3 1 -
A
solution\2100-2199\2194.Cells in a Range on an Excel Sheet\Solution.java
3 1 -
A
solution\2100-2199\2194.Cells in a Range on an Excel Sheet\Solution.cpp
3 1 -
A
solution\0700-0799\0701.Insert into a Binary Search Tree\Solution.java
3 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.py
3 1 1
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3 1 -