main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2399.Check Distances Between Same Letters\Solution.ts
3 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.java
3 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.py
3 1 -
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.cpp
3 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.cpp
3 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.py
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.py
3 1 -
A
solution\0900-0999\0965.Univalued Binary Tree\Solution.ts
3 1 -
A
solution\0900-0999\0954.Array of Doubled Pairs\Solution.py
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.c
4 1 -
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4 1 1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.cpp
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.java
4 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.py
4 1 -
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.cpp
4 1 -
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.java
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -