main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2241.Design an ATM Machine\Solution.cpp
0 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.cpp
0 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.go
 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.java
7 1 -
A
solution\2200-2299\2242.Maximum Score of a Node Sequence\Solution.java
9 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.java
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.cpp
0 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.c
7 1 -
A
solution\2300-2399\2318.Number of Distinct Roll Sequences\Solution.go
 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.go
 1 -
A
solution\2200-2299\2267.Check if There Is a Valid Parentheses String Path\Solution.cpp
0 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.cpp
0 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 -