main
leetcode-crystal
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.cpp
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.py
3 1 -
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.js
3 1 -
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.ts
3 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.py
3 1 -
A
solution\0900-0999\0998.Maximum Binary Tree II\Solution.py
3 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.cpp
3 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.py
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.py
3 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.cpp
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.ts
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\0300-0399\0396.Rotate Function\Solution.java
3 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.js
3 1 -