main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0705.Design HashSet\Solution.go
 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.go
 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.go
 1 -
A
solution\0700-0799\0705.Design HashSet\Solution.ts
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.go
 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.go
 1 -
A
solution\0700-0799\0706.Design HashMap\Solution.go
 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\0700-0799\0706.Design HashMap\Solution.ts
 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.go
 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\0700-0799\0707.Design Linked List\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\0400-0499\0403.Frog Jump\Solution.go
 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.go
 1 -
A
solution\0500-0599\0501.Find Mode in Binary Search Tree\Solution.go
 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.go
 1 -
A
solution\0700-0799\0708.Insert into a Sorted Circular Linked List\Solution.go
 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.go
 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.go
 1 -