main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.py
4 1 -
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.java
4 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.java
4 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.py
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.py
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -
A
solution\0900-0999\0922.Sort Array By Parity II\Solution.java
4 1 -
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.py
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.py
4 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.java
3 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.ts
3 1 -
A
solution\2200-2299\2278.Percentage of Letter in String\Solution.java
3 1 -
A
solution\2200-2299\2275.Largest Combination With Bitwise AND Greater Than Zero\Solution.java
3 1 -
A
solution\2400-2499\2405.Optimal Partition of String\Solution.py
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.java
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.js
3 1 -