main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
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.java
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5 1 -
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.py
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.java
5 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.cpp
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\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5 1 -
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5 1 -
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.java
5 1 -
A
solution\0500-0599\0552.Student Attendance Record II\Solution.py
5 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.js
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.cpp
5 1 -
A
solution\2300-2399\2381.Shifting Letters II\Solution.java
5 1 -
A
solution\2300-2399\2381.Shifting Letters II\Solution.cpp
5 1 -