main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.cpp
5 1 -
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.java
5 1 -
A
solution\0300-0399\0362.Design Hit Counter\Solution.java
5 1 1
A
solution\0700-0799\0776.Split BST\Solution.cpp
5 1 -
A
solution\0300-0399\0362.Design Hit Counter\Solution.py
5 1 -
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5 1 -
A
solution\0300-0399\0312.Burst Balloons\Solution.py
5 1 1
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.cpp
5 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.java
5 1 -
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.js
5 1 -
A
solution\2100-2199\2121.Intervals Between Identical Elements\Solution.py
5 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.py
5 1 -
A
solution\2400-2499\2445.Number of Nodes With Value One\Solution.cpp
5 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5 1 -
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.py
5 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2