main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.py
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.cpp
3 1 -
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.cpp
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.ts
3 1 -
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.java
3 1 -
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.py
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.ts
3 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.ts
3 1 -
A
solution\0300-0399\0376.Wiggle Subsequence\Solution.ts
3 1 -
A
solution\0800-0899\0887.Super Egg Drop\Solution.java
3 1 -
A
solution\0800-0899\0887.Super Egg Drop\Solution.py
3 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.cpp
3 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.py
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.ts
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.py
3 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.py
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\0300-0399\0377.Combination Sum IV\Solution.cs
3 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.py
3 1 -