main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2544.Alternating Digit Sum\Solution.c
2 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.py
2 1 -
A
solution\2400-2499\2490.Circular Sentence\Solution.js
2 1 -
A
solution\2300-2399\2300.Successful Pairs of Spells and Potions\Solution.py
2 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.ts
2 1 -
A
solution\0300-0399\0346.Moving Average from Data Stream\Solution.cpp
2 1 -
A
solution\0300-0399\0371.Sum of Two Integers\Solution.java
2 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.ts
2 1 -
A
solution\0500-0599\0509.Fibonacci Number\Solution.py
2 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.ts
2 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.py
2 1 -
A
solution\0300-0399\0346.Moving Average from Data Stream\Solution.java
2 1 1
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.py
2 1 -
A
solution\0300-0399\0372.Super Pow\Solution.py
2 1 -
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.java
2 1 -
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.py
2 1 -
A
solution\0700-0799\0714.Best Time to Buy and Sell Stock with Transaction Fee\Solution.java
2 1 -
A
solution\0700-0799\0714.Best Time to Buy and Sell Stock with Transaction Fee\Solution.py
2 1 -
A
solution\2200-2299\2264.Largest 3-Same-Digit Number in String\Solution.ts
2 1 -