main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2337.Move Pieces to Obtain a String\Solution.py
12 1 -
A
solution\0500-0599\0572.Subtree of Another Tree\Solution.py
4 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.cpp
0 1 -
A
solution\0300-0399\0357.Count Numbers with Unique Digits\Solution.cpp
4 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.java
11 1 -
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.go
 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
0 1 -
A
solution\0500-0599\0572.Subtree of Another Tree\Solution.ts
7 1 -
A
solution\2400-2499\2405.Optimal Partition of String\Solution.cpp
0 1 -
A
solution\2400-2499\2404.Most Frequent Even Element\Solution.ts
7 1 -
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.ts
4 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.go
 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3 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 -