main
leetcode-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.java
3 1 -
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.ts
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.java
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.js
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.js
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.ts
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.ts
3 1 -
A
solution\2400-2499\2470.Number of Subarrays With LCM Equal to K\Solution.py
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.cpp
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.py
3 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.cpp
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.java
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.java
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.ts
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.java
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.cpp
3 1 -
A
solution\0700-0799\0701.Insert into a Binary Search Tree\Solution.java
3 1 -
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.cpp
3 1 -