main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.py
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.py
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.ts
3 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.py
3 1 -
A
solution\2500-2599\2562.Find the Array Concatenation Value\Solution.java
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cs
3 1 2
A
solution\0600-0699\0621.Task Scheduler\Solution.cpp
3 1 -
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
3 1 1
A
solution\0800-0899\0881.Boats to Save People\Solution.java
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.ts
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3 1 -
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -