main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.java
8 1 -
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.go
 1 -
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.cpp
7 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.ts
8 1 2
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.go
 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.cpp
7 1 -
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.ts
12 1 6
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.py
2 1 -
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.java
17 1 -
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.py
3 1 -
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.java
3 1 -
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.go
 1 -
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.cpp
4 1 -
A
solution\2000-2099\2045.Second Minimum Time to Reach Destination\Solution.py
11 1 -
A
solution\2000-2099\2045.Second Minimum Time to Reach Destination\Solution.java
12 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.py
2 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -