main
leetcode-factor
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0312.Burst Balloons\Solution.java
4 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.java
4 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\0500-0599\0504.Base 7\Solution.java
4 1 -
A
solution\0500-0599\0504.Base 7\Solution.ts
4 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.py
4 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.java
4 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.py
4 1 -
A
solution\0700-0799\0703.Kth Largest Element in a Stream\Solution.cpp
4 1 -
A
solution\0700-0799\0704.Binary Search\Solution.cpp
5 1 -
A
solution\0500-0599\0507.Perfect Number\Solution.java
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.cpp
5 1 -
A
solution\0400-0499\0412.Fizz Buzz\Solution.java
5 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.cpp
5 1 -
A
solution\0300-0399\0362.Design Hit Counter\Solution.java
5 1 1
A
solution\1000-1099\1006.Clumsy Factorial\Solution.py
5 1 -
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\0500-0599\0513.Find Bottom Left Tree Value\Solution.cpp
5 1 -