Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-modula
398
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0566.Reshape the Matrix\Solution.c
4
1
-
A
solution\0800-0899\0841.Keys and Rooms\Solution.cpp
4
1
-
A
solution\0800-0899\0841.Keys and Rooms\Solution.java
4
1
-
A
solution\0500-0599\0566.Reshape the Matrix\Solution.py
4
1
-
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.py
4
1
-
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.java
4
1
-
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4
1
-
A
solution\2300-2399\2336.Smallest Number in Infinite Set\Solution.py
4
1
-
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4
1
-
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.java
4
1
-
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4
1
-
A
solution\2200-2299\2258.Escape the Spreading Fire\Solution.py
4
1
-
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4
1
-
A
solution\0500-0599\0572.Subtree of Another Tree\Solution.py
4
1
-
A
solution\0500-0599\0573.Squirrel Simulation\Solution.cpp
4
1
-
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.ts
4
1
-
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4
1
1
A
solution\0500-0599\0573.Squirrel Simulation\Solution.java
4
1
-
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4
1
-
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.cpp
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!