main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.go
 1 -
A
solution\0800-0899\0855.Exam Room\Solution.go
 1 -
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.go
 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
0 1 -
A
solution\0500-0599\0591.Tag Validator\Solution.go
 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.cpp
0 1 -
A
solution\2300-2399\2363.Merge Similar Items\Solution.go
 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.go
 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.go
 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.cpp
0 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.go
 1 -
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.go
 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.go
 1 -
A
solution\0300-0399\0308.Range Sum Query 2D - Mutable\Solution.go
 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.cpp
0 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.go
 1 -
A
solution\2300-2399\2369.Check if There is a Valid Partition For The Array\Solution.go
 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.go
 1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.cpp
0 1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.go
 1 -