main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0394.Decode String\Solution.java
7 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7 1 -
A
solution\0900-0999\0984.String Without AAA or BBB\Solution.java
7 1 -
A
solution\0900-0999\0984.String Without AAA or BBB\Solution.py
7 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.java
7 1 -
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.java
7 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.py
7 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.java
7 1 -
A
solution\2400-2499\2404.Most Frequent Even Element\Solution.ts
7 1 -
A
solution\0900-0999\0992.Subarrays with K Different Integers\Solution.java
7 1 -
A
solution\2400-2499\2434.Using a Robot to Print the Lexicographically Smallest String\Solution.java
7 1 -
A
solution\2400-2499\2404.Most Frequent Even Element\Solution.cpp
7 1 -
A
solution\2400-2499\2421.Number of Good Paths\Solution.py
7 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.java
7 1 -
A
solution\2500-2599\2516.Take K of Each Character From Left and Right\Solution.cpp
7 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7 1 1
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.cpp
7 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.java
7 1 -