main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.py
2 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
2 1 -
A
solution\0600-0699\0657.Robot Return to Origin\Solution.ts
2 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.py
2 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.cpp
2 1 -
A
solution\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.py
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.java
2 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.py
2 1 1
A
solution\0900-0999\0974.Subarray Sums Divisible by K\Solution.java
2 1 -
A
solution\0900-0999\0979.Distribute Coins in Binary Tree\Solution.cpp
2 1 -
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.py
2 1 -
A
solution\0900-0999\0988.Smallest String Starting From Leaf\Solution.py
1 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.py
1 1 -