main
leetcode-c-sharp
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
4 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.ts
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.java
4 1 -
A
solution\0500-0599\0566.Reshape the Matrix\Solution.c
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.cpp
4 1 1
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\0700-0799\0791.Custom Sort String\Solution.ts
4 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.ts
4 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.py
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.java
4 1 -
A
solution\0700-0799\0795.Number of Subarrays with Bounded Maximum\Solution.java
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.cpp
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.java
4 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.py
4 1 -
A
solution\0700-0799\0798.Smallest Rotation with Highest Score\Solution.cpp
4 1 -