main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\0400-0499\0450.Delete Node in a BST\Solution.java
7 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.java
5 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\2400-2499\2437.Number of Valid Clock Times\Solution.cpp
6 1 -
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.go
 1 -
A
solution\2400-2499\2487.Remove Nodes From Linked List\Solution.go
 1 -
A
solution\2400-2499\2487.Remove Nodes From Linked List\Solution.cpp
6 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.go
 1 -
A
solution\2400-2499\2456.Most Popular Video Creator\Solution.cpp
9 1 -
A
solution\2400-2499\2451.Odd String Difference\Solution.cpp
5 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.py
4 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.c
6 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.go
 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.java
12 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0800-0899\0866.Prime Palindrome\Solution.go
 1 -
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.cpp
5 1 -