main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2262.Total Appeal of A String\Solution.java
2 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.cpp
0 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.go
 1 -
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.go
 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.py
1 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.go
 1 -
A
solution\0500-0599\0554.Brick Wall\Solution.js
4 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
0 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\2300-2399\2301.Match Substring After Replacement\Solution.go
 1 -
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.cpp
0 1 -
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.java
3 1 -
A
solution\2200-2299\2284.Sender With Largest Word Count\Solution.go
 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 -