main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1002.Find Common Characters\Solution.cpp
0 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.java
7 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.java
6 1 -
A
solution\0600-0699\0681.Next Closest Time\Solution.java
15 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.cpp
0 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.py
4 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.cpp
0 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\2025.Maximum Number of Ways to Partition an Array\Solution.py
6 1 -
A
solution\2000-2099\2013.Detect Squares\Solution.py
6 1 -
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.go
 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.cpp
7 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.go
 1 -
A
solution\0300-0399\0368.Largest Divisible Subset\Solution.go
 1 -
A
solution\0400-0499\0405.Convert a Number to Hexadecimal\Solution.cpp
0 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
0 1 -
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.java
8 1 -
A
solution\0900-0999\0989.Add to Array-Form of Integer\Solution.cpp
0 1 -