main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.go
 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
5 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.py
8 1 -
A
solution\0600-0699\0623.Add One Row to Tree\Solution.go
 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.java
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\0400-0499\0497.Random Point in Non-overlapping Rectangles\Solution.java
5 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.java
6 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.cpp
6 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.py
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.go
 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.java
6 1 -
A
solution\0300-0399\0399.Evaluate Division\Solution.go
 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.cpp
8 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.cpp
8 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.py
6 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.c
8 1 -