main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0430.Flatten a Multilevel Doubly Linked List\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\0300-0399\0312.Burst Balloons\Solution.cpp
4 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.cpp
4 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.py
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.cpp
4 1 -
A
solution\0500-0599\0582.Kill Process\Solution.cpp
4 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.java
4 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.java
4 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.cpp
4 1 -
A
solution\0500-0599\0582.Kill Process\Solution.java
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.ts
4 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.cpp
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.py
4 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.cpp
4 1 -