main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2424.Longest Uploaded Prefix\Solution.cpp
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.py
4 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.py
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4 1 -
A
solution\0400-0499\0484.Find Permutation\Solution.py
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.cpp
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.cpp
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.java
4 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.js
4 1 -
A
solution\0400-0499\0486.Predict the Winner\Solution.java
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.cpp
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\0400-0499\0401.Binary Watch\Solution.java
4 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.py
4 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\0400-0499\0401.Binary Watch\Solution.py
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4 1 -
A
solution\0900-0999\0993.Cousins in Binary Tree\Solution.cpp
4 1 -