main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.py
2 1 -
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.py
2 1 -
A
solution\2500-2599\2588.Count the Number of Beautiful Subarrays\Solution.java
2 1 -
A
solution\2500-2599\2527.Find Xor-Beauty of Array\Solution.cpp
2 1 -
A
solution\2400-2499\2491.Divide Players Into Teams of Equal Skill\Solution.js
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.java
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.java
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.cpp
2 1 -
A
solution\0900-0999\0979.Distribute Coins in Binary Tree\Solution.cpp
2 1 -
A
solution\0500-0599\0582.Kill Process\Solution.py
2 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.py
2 1 -
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.py
2 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2 1 -
A
solution\2200-2299\2209.Minimum White Tiles After Covering With Carpets\Solution.py
2 1 -
A
solution\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.java
2 1 -