Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-rockstar
419
issues
2
pull requests
3,788
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7
1
-
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.java
7
1
-
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.cpp
7
1
-
A
solution\0800-0899\0823.Binary Trees With Factors\Solutioin.java
7
1
1
A
solution\0600-0699\0687.Longest Univalue Path\Solution.java
7
1
-
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.cpp
7
1
-
A
solution\0900-0999\0992.Subarrays with K Different Integers\Solution.cpp
7
1
-
A
solution\0900-0999\0992.Subarrays with K Different Integers\Solution.java
7
1
-
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.py
7
1
-
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.ts
7
1
-
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.cpp
7
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.ts
7
1
-
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.cpp
7
1
-
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.py
7
1
-
A
solution\0700-0799\0765.Couples Holding Hands\Solution.cpp
7
1
-
A
solution\0700-0799\0765.Couples Holding Hands\Solution.java
7
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.ts
7
1
-
A
solution\0400-0499\0498.Diagonal Traverse\Solution.py
7
1
-
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.java
6
1
-
A
solution\2000-2099\2094.Finding 3-Digit Even Numbers\Solution.ts
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!