main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.cpp
3 1 -
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.java
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.java
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.py
3 1 -
A
solution\0300-0399\0371.Sum of Two Integers\Solution.py
3 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.py
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.cs
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.js
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.ts
3 1 -
A
solution\0900-0999\0947.Most Stones Removed with Same Row or Column\Solution.py
3 1 -
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.py
3 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.java
3 1 -
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.cpp
3 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.ts
3 1 -
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.py
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.cpp
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.java
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.py
3 1 -