main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.go
 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.go
 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.py
4 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.ts
4 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.go
 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.py
3 1 -
A
solution\0500-0599\0584.Find Customer Referee\Solution.sql
 1 -
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.py
2 1 -
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.java
5 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.py
2 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.go
 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.ts
3 1 -
A
solution\2400-2499\2430.Maximum Deletions on a String\Solution.cpp
7 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.go
 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.go
 1 -
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.cpp
6 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0800-0899\0876.Middle of the Linked List\Solution.go
 1 -