main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
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\0800-0899\0897.Increasing Order Search Tree\Solution.java
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.ts
3 1 1
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.java
3 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cs
3 1 -
A
solution\0800-0899\0867.Transpose Matrix\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.java
3 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.py
3 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.py
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\1000-1099\1015.Smallest Integer Divisible by K\Solution.java
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.cpp
3 1 -