main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2353.Design a Food Rating System\Solution.cpp
0 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
0 1 -
A
solution\0600-0699\0622.Design Circular Queue\Solution.cpp
0 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.cpp
0 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.go
 1 -
A
solution\0300-0399\0391.Perfect Rectangle\Solution.go
 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.go
 1 -
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.cpp
0 1 -
A
solution\0600-0699\0622.Design Circular Queue\Solution.go
 1 -
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.go
 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.cpp
0 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.cpp
0 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.go
 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.go
 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.cpp
0 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.go
 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
0 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.go
 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.cpp
0 1 -
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.cpp
0 1 -