main
leetcode-c-sharp
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.py
9 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.cpp
9 1 -
A
solution\2400-2499\2421.Number of Good Paths\Solution.java
9 1 -
A
solution\0800-0899\0838.Push Dominoes\Solution.ts
9 1 -
A
solution\0800-0899\0838.Push Dominoes\Solution.py
9 1 -
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.java
9 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.cpp
9 1 -
A
solution\0700-0799\0735.Asteroid Collision\Solution.py
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.cpp
9 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.cpp
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.java
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.py
9 1 -
A
solution\0600-0699\0656.Coin Path\Solution.py
9 1 -
A
solution\0600-0699\0677.Map Sum Pairs\Solution.java
9 1 2
A
solution\2400-2499\2416.Sum of Prefix Scores of Strings\Solution.java
9 1 2
A
solution\2100-2199\2147.Number of Ways to Divide a Long Corridor\Solution.java
9 1 -
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.cpp
9 1 -
A
solution\2000-2099\2093.Minimum Cost to Reach City With Discounts\Solution.java
9 1 -
A
solution\0500-0599\0536.Construct Binary Tree from String\Solution.java
9 1 -
A
solution\0700-0799\0733.Flood Fill\Solution.java
9 1 -