main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.cpp
4 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
6 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4 1 -
A
solution\0300-0399\0377.Combination Sum IV\Solution.cpp
5 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.cpp
9 1 -
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.cpp
8 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.java
7 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.cpp
6 1 -
A
solution\2500-2599\2532.Time to Cross a Bridge\Solution.go
 1 -
A
solution\2500-2599\2531.Make Number of Distinct Characters Equal\Solution.py
10 1 -
A
solution\2400-2499\2497.Maximum Star Sum of a Graph\Solution.java
7 1 -
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.java
5 1 -
A
solution\2400-2499\2479.Maximum XOR of Two Non-Overlapping Subtrees\Solution.go
 1 -
A
solution\2400-2499\2472.Maximum Number of Non-overlapping Palindrome Substrings\Solution.py
5 1 -
A
solution\2400-2499\2470.Number of Subarrays With LCM Equal to K\Solution.cpp
3 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.java
8 1 -
A
solution\2400-2499\2453.Destroy Sequential Targets\Solution.go
 1 -
A
solution\0300-0399\0399.Evaluate Division\Solution.cpp
8 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.cpp
5 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -