main
leetcode-beef
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.py
2 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.ts
2 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.py
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.cpp
2 1 -
A
solution\2200-2299\2262.Total Appeal of A String\Solution.cpp
2 1 -
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.java
2 1 -
A
solution\2200-2299\2262.Total Appeal of A String\Solution.java
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
2 1 -
A
solution\0700-0799\0788.Rotated Digits\Solution.py
2 1 1
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.cpp
2 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.cpp
2 1 -
A
solution\0700-0799\0790.Domino and Tromino Tiling\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\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.js
2 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.ts
2 1 -
A
solution\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.cpp
2 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.cpp
2 1 -