main
leetcode-factor
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0427.Construct Quad Tree\Solution.py
1 1 -
A
solution\2100-2199\2168.Unique Substrings With Equal Digit Frequency\Solution.java
10 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.java
3 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4 1 -
A
solution\0500-0599\0548.Split Array with Equal Sum\Solution.cpp
8 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.go
 1 -
A
solution\0700-0799\0773.Sliding Puzzle\Solution.java
22 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.ts
7 1 -
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.java
5 1 -
A
solution\0600-0699\0696.Count Binary Substrings\Solution.cpp
5 1 -
A
solution\1000-1099\1006.Clumsy Factorial\Solution.py
5 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -
A
solution\0400-0499\0408.Valid Word Abbreviation\Solution.java
10 1 -
A
solution\0500-0599\0502.IPO\Solution.cpp
6 1 -
A
solution\0600-0699\0696.Count Binary Substrings\Solution.go
 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.go
 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.java
6 1 -
A
solution\0600-0699\0696.Count Binary Substrings\Solution.java
5 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.py
1 1 -
A
solution\0500-0599\0502.IPO\Solution.go
 1 -