main
leetcode-lol-code
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.py
5 1 -
A
solution\0500-0599\0507.Perfect Number\Solution.cpp
5 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.java
5 1 -
A
solution\0500-0599\0507.Perfect Number\Solution.java
5 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.cpp
5 1 -
A
solution\0700-0799\0710.Random Pick with Blacklist\Solution.py
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\0400-0499\0412.Fizz Buzz\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.java
5 1 -
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.py
5 1 -
A
solution\0400-0499\0412.Fizz Buzz\Solution.java
5 1 -
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.cpp
5 1 -
A
solution\2300-2399\2331.Evaluate Boolean Binary Tree\Solution.java
5 1 -
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Soluttion.ts
5 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.py
5 1 -
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.java
5 1 -
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.py
5 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -