main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.py
2 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.cpp
2 1 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.cpp
2 1 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.java
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.cpp
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.java
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.java
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\0900-0999\0979.Distribute Coins in Binary Tree\Solution.cpp
2 1 -
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.py
2 1 -
A
solution\0900-0999\0992.Subarrays with K Different Integers\Solution.py
2 1 -
A
solution\2000-2099\2052.Minimum Cost to Separate Sentence Into Rows\Solution.py
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\0500-0599\0582.Kill Process\Solution.py
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
2 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2 1 -