main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
0 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.go
 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.go
 1 -
A
solution\0900-0999\0914.X of a Kind in a Deck of Cards\Solution.cpp
0 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.go
 1 -
A
solution\0500-0599\0565.Array Nesting\Solution.cpp
0 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cpp
0 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.go
 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
0 1 -
A
solution\0500-0599\0565.Array Nesting\Solution.go
 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.cpp
0 1 -
A
solution\0800-0899\0818.Race Car\Solution.cpp
0 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.go
 1 -
A
solution\0800-0899\0818.Race Car\Solution.go
 1 -
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.cpp
0 1 -
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.go
 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
0 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.go
 1 -
A
solution\0800-0899\0819.Most Common Word\Solution.cpp
0 1 -
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.cpp
0 1 -