main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.cpp
6 1 -
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.java
6 1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.java
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.cpp
6 1 -
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.cpp
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.java
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.cpp
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.py
6 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.py
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.java
6 1 -
A
solution\2400-2499\2434.Using a Robot to Print the Lexicographically Smallest String\Solution.ts
6 1 -
A
solution\2400-2499\2434.Using a Robot to Print the Lexicographically Smallest String\Solution.py
6 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
6 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.java
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\0800-0899\0879.Profitable Schemes\Solution.cpp
6 1 -
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.java
6 1 1
A
solution\2500-2599\2502.Design Memory Allocator\Solution.py
6 1 -
A
solution\0800-0899\0879.Profitable Schemes\Solution.java
6 1 -
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.cpp
6 1 -