main
leetcode-brainfuck
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.py
3 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.java
3 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.py
3 1 -
A
solution\0600-0699\0621.Task Scheduler\Solution.cpp
3 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.cpp
3 1 -
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
3 1 1
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.java
3 1 -
A
solution\0800-0899\0899.Orderly Queue\Solution.py
3 1 -
A
solution\0800-0899\0899.Orderly Queue\Solution.ts
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.py
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.java
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.py
3 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.py
3 1 1
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.cpp
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.ts
3 1 -
A
solution\0900-0999\0905.Sort Array By Parity\Solution.java
3 1 -
A
solution\0900-0999\0905.Sort Array By Parity\Solution.js
3 1 -
A
solution\0900-0999\0905.Sort Array By Parity\Solution.py
3 1 -